B-Trees on Data Structure and Algorithms related Questions and Answers


Question :   The height of 2-3 tree with n elements is ______
1. between (n/2) and (n/3)
2. (n/6)
3. between (n) and log2(n + 1)
4. between log3(n + 1) and log2(n + 1)
Answer :   4 - between log3(n + 1) and log2(n + 1)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter