kazi1@的部落格

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.

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def godeep(self, root, depth):
        if root is None:
            return depth
        return max(self.godeep(root.left, depth+1), self.godeep(root.right, depth+1))
            
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        return self.godeep(root, 0)