111. Minimum Depth of Binary Tree

/**
 * 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 left =  minDepth(root.left);
      int right =  minDepth(root.right);
      int current =  (left == 0 || right == 0)  ? left + right + 1 : 1 + Math.min(left, right);
      return current;
        
    }
}