Search


Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0.

Answer

Top Questions


Question Reading Views and Total Anwered

Views : 1.9k

Answer : 1


Related Questions