4-line clean JAVA solution


  • 0
    Y
    public class Solution {
        public int minDepth(TreeNode root) {
            if(root == null) return 0;
            if(root.right == null && root.left == null) return 1;
            if(root.right == null || root.left == null) return 1+Math.max(minDepth(root.right), minDepth(root.left));
            return 1+Math.min(minDepth(root.right), minDepth(root.left));
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.