Gate2017 cs Q34

34Let 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.

Option : B
Explanation :

Min height = floor(log₂N) = floor(log₂15)=3
Max height n-1 = 14, when the tree is either left skewed or right skewed.

Forgot your password?

I agree with the Terms.