Question

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. 

(A) 4 and 15 respectively 

(B) 3 and 14 respectively 

(C) 4 and 14 respectively 

(D) 3 and 15 respectively

Answer 1

(B) 3 and 14 respectively 

Min height = floor(log₂ N) = floor( log 15) = 3 

Max height = 14, when the tree is either left skewed or right skewed.