LeetCode 111 Minimum Depth of Binary Tree
来源：互联网 发布：淘宝怎么赚佣金 编辑：程序博客网 时间：2024/06/01 18:17
题目描述
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 104 Maximum Depth of Binary Tree
Minimum Depth的定义如下：
代码
public static int minDepth(TreeNode root) { if (root == null) { return 0; } if (root.left == null && root.right == null) { return 1; } else if (root.left != null && root.right == null) { return minDepth(root.left) + 1; } else if (root.left == null && root.right != null) { return minDepth(root.right) + 1; } return Math.min(minDepth(root.left), minDepth(root.right)) + 1; } 0 0
- LeetCode(111)Minimum Depth of Binary Tree
- LeetCode: Minimum Depth of Binary Tree [111]
- LeetCode 111 Minimum Depth of Binary Tree
- [leetcode 111] Minimum Depth of Binary Tree
- [LeetCode 111]Minimum Depth of Binary Tree
- leetCode #111 Minimum Depth of Binary Tree
- leetcode-111 Minimum Depth of Binary Tree
- leetcode 111 Minimum Depth of Binary Tree
- leetcode || 111、Minimum Depth of Binary Tree
- Leetcode[111]-Minimum Depth of Binary Tree
- leetcode[111]:Minimum Depth of Binary Tree
- LeetCode 111 Minimum Depth of Binary Tree
- [leetcode 111] Minimum Depth of Binary Tree
- leetcode-111-Minimum Depth of Binary Tree
- Leetcode #111 Minimum Depth of Binary Tree
- leetcode 111: Minimum Depth of Binary Tree
- LeetCode 111: Minimum Depth of Binary Tree
- 【LEETCODE】111-Minimum Depth of Binary Tree
- 自定义dialog使用场景—等待层
- ARM汇编指令
- location.href和location.replace和location.reload的不同(location.replace不记录历史)
- ucloud UDataArk 测试
- 中国剩余定理入门
- LeetCode 111 Minimum Depth of Binary Tree
- c# winfrom 在panel上绘制矩形
- Android防止重复点击深入
- Mybatis resultMap空值映射问题解决
- RPM包相关介绍
- POJ1423- 数学
- coderforce Codeforces Round #333 (Div. 1) A. The Two Routes
- RecycleBin 分析
- 行为驱动开发iOS
