给定一棵二叉树,找到它的最小深度。最小深度是从根节点到最近叶节点的最短路径上的节点数量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 run(TreeNode root) {
if(root == null){
return 0;
}
if(root.left == null && root.right == null){
//只有一个根节点
return 1;
}
return depth(root);
}
public int depth(TreeNode root){
if(root.left == null && root.right == null){
return 1;
}
if(root.left ==null){
return depth(root.right)+1;
}
if(root.right ==null){
return depth(root.left)+1;
}
return Math.min(depth(root.left),depth(root.right))+1;
}
}