# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def maxDepth(self, root: TreeNode) -> int:
"""
# DFS
if not root:
return 0
depth = 1
left_depth = self.maxDepth(root.left)
right_depth = self.maxDepth(root.right)
return depth + max(left_depth,right_depth)
"""
# BFS
if not root:
return 0
queue = [root]
depth = 0
while queue:
size = len(queue)
while size>0:
node = queue.pop(0)
if node.left:
queue.append(node.left)
if node.right:
queue.append(node.right)
size -= 1
depth += 1
return depth
每日一道Leetcode -104. 二叉树的最大深度 【DFS|BFS】
最新推荐文章于 2024-10-08 10:36:00 发布