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.

Solution:

/**
 * Definition for binary tree
 * 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 res = minDepthRecur(root,0);
        return res;
    }
    
    public int minDepthRecur(TreeNode curNode, int curDepth){
        if (curNode.left==null&&curNode.right==null){
            return curDepth+1;
        }
        
        int left = Integer.MAX_VALUE;
        int right = Integer.MAX_VALUE;
        if (curNode.left!=null)
            left = minDepthRecur(curNode.left, curDepth+1);
        if (curNode.right!=null)
            right = minDepthRecur(curNode.right,curDepth+1);
        
        if (left<right)
            return left;
        else
            return right;
    }
}

This is a easy recursive problem.