leetcode 111. Minimum Depth of Binary Tree

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

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

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

22 篇文章

订阅专栏

本文探讨了如何求解二叉树的最小深度，并详细解释了递归算法中需要注意的关键点，尤其是对于单个孩子为空的情况如何正确处理。

题目：

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.

求二叉树的最小深度，二叉树的最小深度为根节点到最近叶子节点的距离。

与二叉树的最大深度不同，因为二叉树的最小深度必须是根结点到叶子结点的距离，不能单纯的比较左右子树的递归结果返回较小值，因为对于有单个孩子为空的节点，为空的孩子会返回0，但这个节点并非叶子节点，故返回的结果是错误的。

因此，当发现当前处理的节点有单个孩子是空时，返回一个极大值Integer.MAX_VALUE，防止其干扰结果。

代码AC:

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

hui1140621618

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

LeetCode ---- 111. Minimum Depth of Binary Tree解题报告

杨鑫newlife的专栏

07-05

351

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 childre...

[LeetCode]--111. Minimum Depth of Binary Tree

杜鲁门的博客

10-04

588

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.这个算法的难点就是，要判断左边或右边是否为空，因为如果一边为空，它的深度肯定是小于另外

参与评论您还未登录，请先登录后发表或查看评论

Leetcode 111. Minimum Depth of Binary Tree

SnailTyan

09-18

311

文章作者：Tyan 博客：noahsnail.com  |  优快云  |  简书 1. Description 2. Solution Version 1 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *l...

LeetCode 111. Minimum Depth of Binary Tree

yxccc的博客

06-07

240

111. Minimum Depth of Binary Tree 1.条件不能是root == NULL，而是判断叶子结点的条件。 class MinDepth { public: int minDepth(TreeNode* root) { if (root == NULL) { return 0; } ...

[leetcode] 111. Minimum Depth of Binary Tree

xBlg

05-05

127

找最小深度，要求叶子节点（即没有左右子节点的节点）到根节点的距离最短。递归遍历左右子树的最短长度，如果左子树为空了，就返回右子树的长度。

LeetCode 111. Minimum Depth of Binary Tree（二叉树最小深度）

James Pan

05-24

1106

原题网址：https://leetcode.com/problems/minimum-depth-of-binary-tree/ Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root nod

LeetCode之111. Minimum Depth of Binary Tree

iNiBuBian的博客

03-25

364

LeetCode111. Minimum Depth of Binary Tree

叶卡捷琳堡的博客

11-10

237

【代码】LeetCode111. Minimum Depth of Binary Tree。

Java实现LeetCode 111. Minimum Depth of Binary Tree

最新发布

qq_40260394的博客

12-15

1317

本文将以解释计算二叉树的最小深度的思路为例，致力于用简洁易懂的语言详细描述普通二叉树和右倾斜二叉树在计算最小深度时的区别。通过跟随作者了解右倾斜二叉树的概念以及其最小深度计算过程，读者也将对左倾斜二叉树有更深入的了解。这将为解决LeetCode 111题《Minimum Depth of Binary Tree》提供有力支持。最终，本文将提供LeetCode 111的解题代码。

leetcode刷题笔记(Golang)--111. Minimum Depth of Binary Tree

weixin_44555304的博客

02-19

191

111. Minimum Depth of Binary Tree 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: ...

【LeetCode】111. Minimum Depth of Binary Tree

Microstrong

04-02

391

我的个人微信公众号：Microstrong 微信公众号ID：MicrostrongAI 微信公众号介绍：Microstrong(小强)同学主要研究机器学习、深度学习、计算机视觉、智能对话系统相关内容，分享在学习过程中的读书笔记！期待您的关注，欢迎一起学习交流进步！知乎主页：https://www.zhihu.com/people/MicrostrongAI/activities Git...

leetcode 82. Remove Duplicates from Sorted List II

hui1140621618的博客

03-16

475

题目： Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 要求把链表中所有重复

leetcode 104. Maximum Depth of Binary Tree

hui1140621618的博客

03-17

393

题目： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 找到一棵二叉树的最大深度思路：采用递归的方法，分别找到

leetcode 110.Balanced Binary Tree

hui1140621618的博客

03-17

379

题目: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never

leetcode 136. Single Number

hui1140621618的博客

03-15

356

题目：Given an array of integers, every element appears twice except for one. Find that single one. 找到在数组中只出现过一次的数，要求线性时间，同时空间复杂度为O(1)。思路：将数组中的元素从小到大进行排列，然后比较相邻的元素，判断相邻的元素是否相等。实现代码：另

leetcode 100. Same Tree

hui1140621618的博客

03-16

292

题目： Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 判断两

leetcode 83. Remove Duplicates from Sorted List

hui1140621618的博客

03-16

274

题目：Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 将所有重复的元素从有序的链表中删除

求解二叉树最小深度的LeetCode题目解答

- 本资源提供的代码专为解决LeetCode上的“Minimum Depth of Binary Tree”这一题目而设计。 6. 算法测试与调试： - 在算法开发过程中，代码的测试和调试是至关重要的环节。 - 正确性测试通常需要覆盖不同的测试...