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

Question 21 : AVL trees provide better insertion the 2-3 trees.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 22 : In a B+ tree, both the internal nodes and the leaves have keys.
1. True
2. False
3.
4.
View Answer   Discuss with Members


View 21 - 22 of 22 Questions

* 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