leetcode:111. Minimum Depth of Binary Tree

chengxuanye2079

于 2017-01-28 17:42:00 发布

阅读量95

点赞数

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/avenger222/blog/830637

本文详细解析了LeetCode上的一道经典算法题：寻找二叉树的最小深度。通过递归遍历的方式，算法能够找到从根节点到最近叶节点的最短路径，即最小深度。文章提供了一个Python实现的示例代码，并解释了其工作原理。

摘要生成于 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.

Subscribe to see which companies asked this question.

# -*- coding:utf-8 -*- 
# leetcode solutions
# 111. Minimum Depth of Binary Tree
# coding by Dennis Lu
# 2017/02/01

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        current_nodes = []
        if(root == None): return 0
        current_nodes.append(root)
        levels = 1

        while(1):
        	next_nodes = []
        	for i in current_nodes:
        		if(i.left == None and i.right == None):
        			return levels
        		if(i.left != None):
        			next_nodes.append(i.left)
        		if(i.right != None):
        			next_nodes.append(i.right)
        	current_nodes = next_nodes
        	levels = levels + 1

转载于:https://my.oschina.net/avenger222/blog/830637