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.
java:
/**
* 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;
int left = minDepth(root.left);
int right = minDepth(root.right);
if (left==0){return right+1;}
if (right==0){return left+1;}
return Math.min(left,right)+1;
}
}