【leetcode】Minimum Depth of Binary Tree

最新推荐文章于 2025-09-12 17:31:31 发布

转载最新推荐文章于 2025-09-12 17:31:31 发布 · 47 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/MrLJC/p/4376320.html

文章标签：

#数据结构与算法

本文介绍了一种求解二叉树最小深度的算法实现，通过递归方式遍历二叉树并找到从根节点到最近叶子节点的最短路径长度。

题目简述：

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.

解题思路：

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

class Solution:
    # @param root, a tree node
    # @return an integer
    min = 99999
    def minDeep(self, root, cur):
        if root == None:
            self.min = 0
            return 
        cur += 1
        if root.left == None and root.right ==None:
            if self.min >cur:
                self.min = cur
                return
        
        if root.left != None:
            self.minDeep(root.left, cur)
        if root.right != None:
            self.minDeep(root.right, cur)
        
    def minDepth(self, root):
        self.minDeep(root, 0)
        return self.min

转载于:https://www.cnblogs.com/MrLJC/p/4376320.html