Java Solution


  • 0
    T

    '''

        public int recurse(TreeNode root) {
        if (root == null) {
            return 0;
        }
        
        if (root.left == null) {
            return 1 + recurse(root.right);
        }
        
        if (root.right == null) {
            return 1 + recurse(root.left);
        }
        
        return 1 + Math.min(minDepth(root.left), minDepth(root.right));
        
        
        
    }
    

    ''''


Log in to reply
 

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