leecode-111-二叉树的最小深度

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int minDepth(TreeNode root) {
        // base case
        if(root == null) return 0;
        // 递归生成左右子树的最小深度
        int left = minDepth(root.left);
        int right = minDepth(root.right);
        // 情况一：左子树最小深度为 0
        if (left == 0) 
        return right + 1;
        // 情况二：右子树最小深度为 0
        if (right == 0)
        return left + 1;
        // 情况三：左右子树最小深度均不为 0
        return Math.min(left,right) + 1;
    }
}