leetcode题记——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; }
 * }
 */
class Solution {
    public int minDepth(TreeNode root) {
        if (root == null) return 0;
        int mL = minDepth(root.left);
        int mR = minDepth(root.right);
        if(mL == 0 || mR == 0)
            return mL>=mR?mL+1:mR+1;
        return Math.min(mL,mR)+1;
    }
}