edited by
5,120 views
3 votes
3 votes

A binary search tree is used to locate the number $43.$ Which of the following probe sequence is not possible?

  1. $61 \quad   52 \quad  14 \quad  17 \quad  40 \quad  43$
  2. $23 \quad 50 \quad  40 \quad  60  \quad  43$
  3. $10 \quad  65 \quad  31\quad  48\quad  37 \quad  43$
  4. $81 \quad  61 \quad  52  \quad  14  \quad   41  \quad   43$
edited by

1 Answer

Best answer
8 votes
8 votes

The right answer for this question is B.

selected by

Related questions

2 votes
2 votes
1 answer
1
radha gogia asked Jul 14, 2015
5,502 views
1. 2, 252, 401, 398, 330, 344, 350, 3602. 924, 220, 911, 244, 898, 258, 362, 3603. 925, 202, 911, 240, 950, 245, 3604. 2, 399, 387, 219, 266, 382, 381, 278, 360
1 votes
1 votes
1 answer
2
pradeepchaudhary asked Aug 19, 2018
19,111 views
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)