[LeetCode] Challenge log 104

Posted on | Edited on |
104. Maximum Depth of Binary Tree

Root height = max(left height, right height) +1

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

1
2
3
4
5
  3
 / \
9  20
  /  \
 15   7

return its depth = 3.

Soulution:
1
2
3
4
5
6
7
8
class Solution:
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root is None: return 0
        return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))
0%