A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined?
a. 925, 221, 912, 245, 899, 259, 363, 364
b. 3, 400, 388, 220, 267, 383, 382, 279, 364
c. 926, 203, 912, 241, 913, 246, 364
d. 3, 253, 402, 399, 331, 345, 398, 364
Answer:926, 203, 912, 241, 913, 246, 364
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: