The minimum height of self balancing binary search tree with n nodes is
A. log2(n)
B. n
C. 2n + 1
D. 2n – 1
Answer:A
The minimum height of self balancing binary search tree with n nodes is
A. log2(n) B. n C. 2n + 1 D. 2n – 1