- 二叉树的最大深度
给定一个二叉树,找出其最大深度。
二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
说明: 叶子节点是指没有子节点的节点。、
1.递归:
树的高度等于左右子树高度的最大值加上1
# 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 is None:
return 0
left = self.maxDepth(root.left)
right = self.maxDepth(root.right)
return max(left, right) + 1
2.迭代
每访问一层更新一次深度
class Solution:
def maxDepth(self, root):
stack = []
if root is not None:
stack.append((root,1))
maxdepth = 0
while stack != []:
root,d = stack.pop()
if root is not None:
maxdepth = max(maxdepth, d)
stack.append((root.left,d+1))
stack.append((root.right,d+1))
return maxdepth