LeetCode 111. Minimum Depth of Binary Tree
来源：互联网 发布：java程序员个人评价 编辑：程序博客网 时间：2024/06/05 23:01
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.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int minDepth(TreeNode root) { int left,right; if(root==null){ return 0; }else if(root.left==null && root.right==null){ return 1; }else if(root.left!=null && root.right!=null){ left = minDepth(root.left); right =minDepth(root.right); return Math.min(left,right)+1; }else if(root.left==null){ return minDepth(root.right)+1; }else { return minDepth(root.left)+1; } }}阅读全文
0 0
- 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
- 111. Minimum Depth of Binary Tree LeetCode
- 【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
- 111.[Leetcode]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
- 清澄A1223. 画圈圈(范浩强)
- Linux下安装、配置Apache服务器
- spring boot demo 通过maven构建
- 做个行动派----写给未来三年的自己
- 《凯恩斯革命的前世今生》导语集（前三章）
- LeetCode 111. Minimum Depth of Binary Tree
- 1064. Complete Binary Search Tree (30)
- C语言-数据结构-链串插入删除链接
- ios各种异常crash总结
- 读书笔记《Effective C++》条款32：确定你的public继承塑模出is-a关系
- 第27章 无失真系统与理想低通
- 手游页游和端游的服务端的架构与区别
- HDU 5418 （状压dp+floyd)
- 4835: [Lydsy2017年4月月赛]遗忘之树
