The maximum height of a binary search tree will be when the tree is fully skewed
Maximum height $= n - 1 = 15 – 1 = 14$
The minimum height of a binary search tree will be when the tree is full.
Minimum height $= \log_2( n + 1 ) – 1 = \log_2( 15 + 1 ) – 1 = \log_2( 16 ) – 1 = 4 - 1 = 3$
Correct Answer: $B$