Leetcode 111. Minimum Depth of Binary Tree
2017-01-16 09:21
429 查看
public class Solution {
public int minDepth(TreeNode root) {
if (root == null) return 0;
// take care of the trees that only have left or right child
if (root.left == null) return minDepth(root.right) + 1;
if (root.right == null) return minDepth(root.left) + 1;
return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode111.MinimumDepthofBinary Tree
- 【LeetCode】104. Maximum Depth of Binary Tree
- LeetCode: 104. Maximum Depth of Binary Tree
- LeetCode-226. Invert Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- Leetcode 111. Minimum Depth of Binary Tree
- 【LeetCode】104.Maximum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- Leetcode-111. Minimum Depth of Binary Tree
- leetcode 543. Diameter of Binary Tree
- LeetCode: Binary Tree Sum相关题目合集
- [LeetCode] 111. Minimum Depth of Binary Tree
- [Leetcode] 111. Minimum Depth of Binary Tree
- [leetcode] 111. Minimum Depth of Binary Tree
- leetcode 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- LeetCode-111. Minimum Depth of Binary Tree
- [leetcode]#111. Minimum Depth of Binary Tree
- 【LeetCode】104. Maximum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree