leetCode练习（111）

题目：Minimum Depth of Binary Tree          

难度：easy

问题描述：

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.

解题思路：

求最小深度。注意，这里的最小深度是指从根节点到叶子节点的距离中的最短距离。（1，2）的最短节点是1-2，而不是1-null。

代码如下：

/**
 * Definition for a binary tree node.
 * 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&&right!=0){
        	return Math.min(left, right)+1;
        }else{
        	if(left!=0){
        		return left+1;
        	}
        	if(right!=0){
        		return right+1;
        	}
        	return 1;
        }
    }
}