Leetcode - 104. Maximum Depth of Binary Tree

Leetcode - 104. Maximum Depth of Binary Tree

• Given the root of a binary tree, return its maximum depth.

  A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Solution

func maxDepth(root *TreeNode) int {
    if root == nil{
        return 0
    }

    leftDepth := maxDepth(root.Left)
    rightDepth := maxDepth(root.Right)

    if leftDepth>rightDepth{
        return leftDepth+1
    }
    return rightDepth+1
    
}