leetcode-Maximum Depth of Binary Tree-python

leetcode 的 二叉树最大深度问题

先上代码

__author__ = 'winterhouse'


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


class Solution:
    def maxDepth(self, root):
        return treeDepth(root)
def treeDepth(tree):
    if tree==None:
         return 0
    leftDepth=treeDepth(tree.left)
    rightDepth=treeDepth(tree.right)
    if leftDepth>rightDepth:
        return leftDepth+1
    if rightDepth>=leftDepth:
        return rightDepth+1

这个问题是比较简单的问题了，采用分治和递归