[leetCode By python]104. 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.

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

    3
   / \
  9  20
    /  \
   15   7

return its depth = 3.

代码＋调试：

# 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 maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root ==None:
            return 0
        return 1+max(self.maxDepth(root.left),self.maxDepth(root.right))

if __name__ == '__main__':
    l1_1 = TreeNode(1)
    l1_2 = TreeNode(2)
    l1_3 = TreeNode(3)

    l1_1.left = l1_2
    l1_1.right = l1_3

    l3 = Solution().maxDepth(l1_1)
    print l3