COMPUTER SCIENCE MCQS
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: [G17S1Q6]
Explanation