给定一个二叉树,找出其最大深度。
二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
说明: 叶子节点是指没有子节点的节点。
示例:
给定二叉树 [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
返回它的最大深度 3 。
思路1:dfs
# 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:
deep = 1
mdeep = 0
def maxdeep(root):
nonlocal deep,mdeep
if not (root.left or root.right):
if deep>mdeep:
mdeep = deep
if root.left:
deep+=1
maxdeep(root.left)
deep-=1
if root.right:
deep+=1
maxdeep(root.right)
deep-=1
if not root :
return 0
else:
maxdeep(root)
return mdeep
思路2:递归
# 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 not root:
return 0
else:
l = self.maxDepth(root.left)
r = self.maxDepth(root.right)
return max(l,r)+1