任务描述
代码实现
# 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: TreeNode) -> int: if root == None: return 0 return 1+max(self.maxDepth(root.left),self.maxDepth(root.right))