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 {
List<Integer> list = new LinkedList<>();
public int minDepth(TreeNode root) {
if(root==null) return 0;
depth(root, 1);
int res = list.get(0);
for(int i: list){
if(i<res)
res=i;
}
return res;
}
public void depth(TreeNode root, int count){
if(root.left==null && root.right==null)
list.add(count);
if(root.left!=null) depth(root.left, count+1);
if(root.right!=null) depth(root.right, count+1);
}
}
总觉得,我自己写的,虽然大致思路上是对的,但在实现中总有点笨拙。
————————————————
public 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;
else return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
}
不需要记录每一条路线的高度,只要永远只记录左右子树中矮的那一个就行。
层序遍历:(非递归)
//遍历版 层次遍历法
public int minDepth1(TreeNode root) {
if(root == null) return 0;
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
int level = 0;
while(!queue.isEmpty()) {
int levelLen = queue.size();
level ++;
for (int i = 0; i < levelLen; i++) {
TreeNode node = queue.removeFirst();
if(node.left == null && node.right == null) return level;
if(node.left != null) queue.add(node.left);
if(node.right != null) queue.add(node.right);
}
}
return level;
}