【leetcode】-111. Minimum Depth of Binary Tree BFS算法

turbo624

于 2020-06-19 14:25:54 发布

阅读量230

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_44110891/article/details/106855582

LeetCode 专栏收录该内容

116 篇文章

订阅专栏

本文详细解析了如何使用广度优先搜索(BFS)算法求解二叉树的最小深度，通过队列实现节点逐层遍历，直至找到最近的叶子节点，返回从根节点到该叶子节点的路径长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7]

return its minimum depth = 2.

BFS

用队列进行广度优先遍历，每遍历一层，深度就加+1，遍历到最底层就是树的最小深度了。

python代码

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root:
            return 0
        queue = []
        queue.append(root)
        depth = 1
        while queue:
            for i in range(len(queue)):
                temp = queue.pop(0)
                if not temp.left and not temp.right:
                    return depth
                if temp.left:
                    queue.append(temp.left)
                if temp.right:
                    queue.append(temp.right)
            depth += 1
            
        return depth