Minimum Depth of Binary Tree

最新推荐文章于 2023-12-15 03:22:29 发布

原创最新推荐文章于 2023-12-15 03:22:29 发布 · 366 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

1 篇文章

订阅专栏

本文介绍如何通过递归的方式找到二叉树中的最小深度，即从根节点到最近叶子节点的最短路径长度。

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

class Solution:
    # @param root, a tree node
    # @return an integer
    def minDepth(self, root):
        if root == None:
            return 0
        
        if root.left == None and root.right == None:
            return 1
        
        leftDepth=self.minDepth(root.left)
        rightDepth = self.minDepth(root.right)
        
        if leftDepth == 0:
            return rightDepth + 1
        elif rightDepth == 0:
            return leftDepth + 1
        else:
            return min(leftDepth,rightDepth) + 1