Redirected
recategorized by
9,558 views
1 votes
1 votes

Suppose that we have numbers between $1$ and $1000$ in a binary search tree and we want to search for the number $365$. Which of the following sequences could not be the sequence of nodes examined ?

  1. $4, 254, 403, 400, 332, 346, 399, 365$
  2. $926, 222, 913, 246, 900, 260, 364, 365$
  3. $927, 204,913, 242, 914, 247, 365$
  4. $4, 401, 389, 221, 268, 384, 383, 280, 365$ 
recategorized by

3 Answers

1 votes
1 votes
ans is c as in option c, 914 can not be travelled after 913
Answer:

Related questions

4 votes
4 votes
2 answers
1
makhdoom ghaya asked Aug 2, 2016
5,614 views
Which of the following computing models is not an example of distributed computing environment ?Cloud computingParallel computing Cluster computing Peer-to-peer computing...
2 votes
2 votes
1 answer
3
makhdoom ghaya asked Aug 2, 2016
1,576 views
Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ?Windows Vista Windows $2000$Wi...