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 ?
A. 4, 254, 403, 400, 332, 346, 399, 365
B. 926, 222, 913, 246, 900, 260, 364, 365
C. 927, 204,913, 242, 914, 247, 365
D. 4, 401, 389, 221, 268, 384, 383, 280, 365
Answer:C
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 ?
A. 4, 254, 403, 400, 332, 346, 399, 365 B. 926, 222, 913, 246, 900, 260, 364, 365 C. 927, 204,913, 242, 914, 247, 365 D. 4, 401, 389, 221, 268, 384, 383, 280, 365