入门级别的题目,比较容易,直接一个递归拿下。
class Solution(object):
def maxDepth(self, root):
"""
:type root: TreeNode
:rtype: int
"""
def find_depth(node):
if not node:
return 0
return max(find_depth(node.left), find_depth(node.right)) + 1
return find_depth(root)