LintCode 二叉树的最小深度

给定一个二叉树，找出其最小深度。
二叉树的最小深度为根节点到最近叶子节点的距离。

样例
给出一棵如下的二叉树:

    1

 /     \ 

2       3

      /    \

    4      5  

这个二叉树的最小深度为 2

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.
Example
Given a binary tree as follow:

    1

 /     \ 

2       3

      /    \

     4      5  

The minimum depth is 2

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: An integer.
     */
    public int minDepth(TreeNode root) {
        if(null == root) return 0;
        if(null == root.left) return minDepth(root.right) + 1;
        if(null == root.right) return minDepth(root.left) + 1;
        return Math.min(minDepth(root.left),minDepth(root.right)) + 1;
    }
}