Q153
The minimum height of self balancing binary search tree with n nodes is . . . . . . . .
A.
log2(n)
AnswerB.
n
C.
2n + 1
D.
2n - 1
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board