这个也好顺,8分钟做完,没有报错。
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 binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int minDepth(TreeNode root) {
if (root == null) {
return 0;
}
if (isLeaf(root)) {
return 1;
}
int result = 1;
List<TreeNode> nodePool = new ArrayList<TreeNode>();
nodePool.add(root);
while (true) {
List newNodePool = new ArrayList<TreeNode>();
for (TreeNode node : nodePool) {
if (isLeaf(node)) {
return result;
} else {
if (node.left != null) {
newNodePool.add(node.left);
}
if (node.right != null) {
newNodePool.add(node.right);
}
}
}
nodePool = newNodePool;
result ++;
}
}
private boolean isLeaf(TreeNode node) {
return node.left == null && node.right == null;
}
}