GATE Computer Science (CS) 2017 Shift 1 Solved Paper

Question : 16 of 65

Marks: +1, -0

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.