111. Minimum Depth of Binary Tree

题目：

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 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;}
        return minDepth(root, 1);
    }
    
    public int minDepth(TreeNode root, int depth){
        /* 若左右子树都存在时，最短深度为左右子树中深度较浅的一个
         * 若存在任一子树时，最短深度为该子树的最短深度
         * 若不存在子树时，则返回当前深度
        */
        if(root.left != null && root.right != null){
            int left = minDepth(root.left, depth+1);
            int right = minDepth(root.right, depth+1);
            return Math.min(left,right);
        }else if(root.left != null){
            return minDepth(root.left, depth+1);
        }else if(root.right != null){
            return minDepth(root.right, depth+1);
        }else{
            return depth;
        }
    }
}