154

google search

Already Answered By

1: Question:
Suppose that we have numbers between 1 and 1,000 in a binary search tree and want to search for the number 370. Which of the following sequences
could not be the sequence of nodes examined ?
Answer:
Only one Option is correct. Choose the same. Please note there is Negative Marking for wrong answers.
926, 203, 912, 241, 913, 246, 370
3, 400, 388, 220, 267, З83, 382, 279, 370
925, 221, 912, 245, 899, 259, 363, З70
3, 253, 402, 399, 331, З45, 398, 370


Answer: C

Answered by: aditya panda

2: Question:
A binary search tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24
The number of the node in the left sub-tree and right sub-tree of the root, respectively, is
Answer:
Only one Option is correct. Choose the same. Please note there is Negative Marking for wrong answers.
(3, 8)
(7, 4)
(8, 3)
(4, 7)


Answer: B

Answered by: aditya panda

Google search results: