Problem: 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.

Solution: Maxinum Depht of Binary Tree, Python:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    # @param root, a tree node
    # @return an integer
    def maxDepth(self, root):
        
        if root is None:
            
            return 0
            
        return 1 + max(Solution().maxDepth(root.left), Solution().maxDepth(root.right))

深搜，递归求解。