1.

Suppose we have to insert the following sequence of keys into an empty binary search tree:5, 7, 45, 60, 50, 23, 15, 54What would be the height of binary search tree?

A. 3
B. 4
C. 5
D. 6
Answer» D. 6


Discussion

No Comment Found