难度简单480收藏分享切换为英文接收动态反馈
给定一个二叉树,找出其最小深度。
最小深度是从根节点到最近叶子节点的最短路径上的节点数量。
说明:叶子节点是指没有子节点的节点。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:2
示例 2:
输入:root = [2,null,3,null,4,null,5,null,6]
输出:5
提示:
- 树中节点数的范围在
[0, 105]
内 -1000 <= Node.val <= 1000
1.DFS:
# 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 minDepth(self, root: TreeNode) -> int:
if not root:
return 0
if not (root.left or root.right):
return 1
if root.left and root.right:
return 1 + min(self.minDepth(root.left),self.minDepth(root.right))
elif root.left and not root.right:
return 1 + self.minDepth(root.left)
else:
return 1 + self.minDepth(root.right)
2.BFS
# 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 minDepth(self, root: TreeNode) -> int:
if not root:
return 0
# if not (root.left or root.right):
# return 1
# if root.left and root.right:
# return 1 + min(self.minDepth(root.left),self.minDepth(root.right))
# elif root.left and not root.right:
# return 1 + self.minDepth(root.left)
# else:
# return 1 + self.minDepth(root.right)
queue = collections.deque()
queue.append(root)
cnt = 1
while queue:
for i in range(len(queue)):
node = queue.popleft()
if not (node.left or node.right):
return cnt
else:
if node.left:
queue.append(node.left)
if node.right:
queue.append(node.right)
cnt += 1
return cnt