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


Question :   A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?
1. 6
2. 3
3. 4
4. 7
Answer :   2 - 3  

* 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