python-leetcode面试题解之第104题二叉树的最大深度-题解.zip

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