Height of a binary search tree is minimum if it is a complete binary search tree..
Minimum height is lg(n+1)-1 as given n = 15 hence on solving We get lg(15+1) -1 which is equal to 3.
In the worst case the binary search tree will be skewed hence the max height will be 14.
Correct me if I am wrong.
I am new to this platform so please guide me further..