Minimum Depth of Binary Tree Java

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;
        }
        
        if (root.left == null && root.right == null) {
            return 1;
        }
        int minLeft=minDepth(root.left);
        int minRight=minDepth(root.right);
        if(minLeft == 0) {minLeft = Integer.MAX_VALUE; }
        if(minRight == 0){minRight = Integer.MAX_VALUE;}  
        return Math.min(minLeft,minRight)+1;
    }
}