why and how is the complexity coming out to be O(n).
Quiz question 3 trees
@Jaideep_singh which question are you talking about? Please share the question as I cannot find any question related to finding time/space complexity here. Q3 in this quiz is this
BST - Searching
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
Choices
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 , 363I 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.