111. Minimum Depth of Binary Tree
2016-11-09 21:19
232 查看
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.
思路：与104. Maximum Depth of Binary Tree类似。
在左右子树都不为空的条件下，根节点的最小深度 = 左右子树的最小深度+1。如果左子树为空，则最小深度为右子树的深度+1。反之亦然。
Javascript代码:
var minDepth = function(root) {
if(root == null) return 0;
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;
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- HDU 5573 Binary Tree 找规律二进制
- Binary Tree Traversal(Preorder, Inorder, Postorder )
- HDU 5573 Binary Tree 构造
- 【leetcode】111. Minimum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 543. Diameter of Binary Tree
- LeetCode543. Diameter of Binary Tree
- [LeetCode] 111. Minimum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree
- Binary Tree
- LeetCode543. Diameter of Binary Tree
- POJ 2499 Binary Tree
- LeetCode 545. Boundary of Binary Tree
- 111. Minimum Depth of Binary Tree
- Sicily 1156. Binary tree
- 线索二叉树Threaded binary tree
- POJ 2499 Binary Tree
- Binary Tree Preorder Traversal
- Binary Tree