LeetCode 111 Minimum Depth of Binary Tree
1. 2. class Solution {
public int minDepth(TreeNode root) {
if(root==null){
return 0;
}
if(root.left==null){
return minDepth(root.right)+1;
相关文章
- 1. [LeetCode]111.Minimum Depth of Binary Tree
- 2. LeetCode 111. Minimum Depth of Binary
- 3. 111. Minimum Depth of Binary Tree
- 4. 111.minimum depth of binary tree
- 5. LeetCode.3.minimum-depth-of-binary-tree
- 6. 【leetcode】Minimum Depth of Binary Tree
- 7. leetcode, LC1: Minimum Depth of Binary Tree
- 8. Minimum Depth of Binary Tree [LeetCode]
- 9. LeetCode - Minimum Depth of Binary Tree
- 10. [Leetcode-Tree]Maximum / Minimum Depth of Binary Tree
- 更多相关文章...
- • XSLT
- • XSLT
- • 算法总结-深度优先算法
- • 算法总结-广度优先算法
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. [LeetCode]111.Minimum Depth of Binary Tree
- 2. LeetCode 111. Minimum Depth of Binary
- 3. 111. Minimum Depth of Binary Tree
- 4. 111.minimum depth of binary tree
- 5. LeetCode.3.minimum-depth-of-binary-tree
- 6. 【leetcode】Minimum Depth of Binary Tree
- 7. leetcode, LC1: Minimum Depth of Binary Tree
- 8. Minimum Depth of Binary Tree [LeetCode]
- 9. LeetCode - Minimum Depth of Binary Tree
- 10. [Leetcode-Tree]Maximum / Minimum Depth of Binary Tree