leetcode 108 Convert Sorted Array to Binary Search Tree

Question

When I run this leetcode problem, I used the code below:

class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        TreeNode root = sortedBST(nums, 0, nums.length-1);
        return root;
    }

    public TreeNode sortedBST(int[]nums, int low, int high){
        if(low > high) return null;
        int temp = (low + high) / 2;
        TreeNode node = new TreeNode(nums[temp]);
        node.left = sortedBST(nums, 0, temp - 1);
        node.right = sortedBST(nums, temp + 1, high);
        return node;

    }
}

instead of the correct output [0,-3,9,-10,null,5] for the sorted array [-10,-3,0,5,9], my output result is [0,-10,5,null,-3,-3,9,-10,null,-10,0,-3,null,null,null,null,null,-10,null,-10,0,null,-3,null,null,-10,5,-10,null,null,-3,-3,null,null,null,-10,null,-10,0,null,null,null,null,-10,null,null,-3,-10].

I'm confused about this results, why it has so many outputs?

Md Johirul Islam · Accepted Answer · 2018-05-26 19:49:19Z

1

Change the line

    node.left = sortedBST(nums, 0, temp - 1);

To

    node.left = sortedBST(nums, low, temp - 1);

answered May 26, 2018 at 19:49

Md Johirul Islam

5,1924 gold badges28 silver badges57 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

leetcode 108 Convert Sorted Array to Binary Search Tree

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related