1.

Consider an empty binary search tree into which the following numbers are inserted in the given order: 10,1, 3, 5, 15, 12, 16. The height of the maximum distance of a leaf node from the root is 

A. 2
B. 4
C. 3
D. 8
Answer» D. 8


Discussion

No Comment Found

Related MCQs