we are given just inorder array of bst
there will be no unique bst exist for one inorder array
so how to take build bst
Replace sum with greater nodes
Just build the bst using the given sorted array. It must taught in any video lecture.
In this, you make a root node from the mid element of the array, then you send the left part of the array to build the left subtree and the right part to build the right subtree. Recursively the tree is built
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.