LeetCode:Maximum Depth of Binary Tree

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:
#     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==None):
            return 0;
        else:
            maxDepthLeft=self.maxDepth(root.left);#递归的思想，深度是左子树或者右子数的比较大的深度，然后算上自己要加1
            maxDepthRight=self.maxDepth(root.right);
            if (maxDepthLeft>maxDepthRight):
                return maxDepthLeft+1
            else:
                return maxDepthRight+1