[leetcode tree]104. Maximum Depth of Binary Tree

求树的最大深度

class Solution(object):
    def maxDepth(self, root):
        if not root:
            return 0
        left = self.maxDepth(root.left)
        right = self.maxDepth(root.right)
        return left+1 if left>right else right+1

 1 line python

class Solution(object):
    def maxDepth(self, root):
        return 1+max(map(self.maxDepth,(root.left,root.right))) if root else 0