Build BST problem

#1

I am getting a wrong output. Please help me correct my code.

#2

hey @rahul.gupta03111999

node* build(int n){
int d;
// cin>>d;remove from here
node*root = NULL;
while(n–){
cin>>d;//take here
root = insertInBST(root,d);
}
return root;
}

#3

otherwise takes one extra number as input

#4

I am still getting the same output.

#5

Hey @rahul.gupta03111999
You haven’t understood the problem
You have to make BST from sorted array by making its middle as root and then making recursive calls for left and right

after doing that u have to print preorder

  • Get the Middle of the array and make it root.
  • Recursively do same for left half and right half.
    • a) Get the middle of left half and make it left child of the root created in step 1.
    • b) Get the middle of right half and make it right child of the root created in step 1.
#6

Hey @rahul.gupta03111999
If this is resolved then mark it so
Otherwise let me know the problem :slight_smile:

#7

Can you tell me how can I mark it solved?

#8

I will do that …:slight_smile:

#9

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.