A binary search tree has numbers between 1 and 1000. On search to find the number 363, which of the following sequence could not be the correct one
2 , 399 , 387 , 219 , 266 , 382 , 381 , 278 , 363
925 , 202 , 911 , 240 , 912 , 245 , 363
924 , 220 , 911 , 244 , 898 , 258 , 362 , 363
2 , 252 , 401 , 398 , 330 , 344 , 397 , 363
In first option 2 is root node, BST will be starting with the right child of root. 399 → 387 → 219 → 266 → 382 → 381 → 278 → 363 respectively. Here all numbers will be examined while searching for 363.
In second option 925 is root node, BST will be starting with the left child of root i.e. 202 → 911 → 240 next key is 912 we cant go for 912 after 240 because we are already in left BST of 911 our key will be surely in left BST of 911. This option is incorrect.
In third option 924 is root node, BST will be starting with the left child of root. Next node is 220 → 911 → 244 → 898 → 258 → 362 → 363 respectively.
In fourth option 2 is root node, BST will be starting with the right child of root i.e. 252 → 401 → 398 → 330 → 344 → 397 → 363.
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.