111. Minimum Depth of Binary Tree

最新推荐文章于 2023-05-05 15:23:35 发布

ForABiggerWorld

最新推荐文章于 2023-05-05 15:23:35 发布

阅读量160

点赞数

分类专栏： leetcode 递归

本文链接：https://blog.csdn.net/zjucor/article/details/81902372

版权

leetcode 同时被 2 个专栏收录

558 篇文章 0 订阅

订阅专栏

递归

26 篇文章 0 订阅

订阅专栏

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.

因为leaf node的左右子树都是None，所以递归到leaf node的时候就不能继续递归下去了

但是不影响递归的套路

# Definition for a binary tree node.

class Solution:
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root: return 0
        if not root.left: return 1+self.minDepth(root.right)
        if not root.right: return 1+self.minDepth(root.left)
        return 1+min(self.minDepth(root.left), self.minDepth(root.right))