5-line easy-to-understand java code beats 99.5%

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

Log in to reply

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