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;
int tleft=run(root.left);
int tright=run(root.right);
if(tleft==0 && tright==0) return 1;
if(tleft==0) tleft=Integer.MAX_VALUE;
if(tright==0) tright=Integer.MAX_VALUE;
return Math.min(tleft,tright)+1;
}
}