Download Android App in your Android Device from Google Play Store
- Search for "Withoutbook Practice Exam Test" in Mobile/Tablet Play Store
Practice InterviewNew Search by Name or Email

Exams Attended

Make Homepage

Bookmark this page

Subscribe Email Address

C Interview Questions and Answers

Ques. What are the advantages and disadvantages of B-star trees over Binary trees?
Ans.
Answer1
B-star trees have better data structure and are faster in search than Binary trees, but it?s harder to write codes for B-start trees.

Answer2
The major difference between B-tree and binary tres is that B-tree is a external data structure and binary tree is a main memory data structure. The computational complexity of binary tree is counted by the number of comparison operations at each node, while the computational complexity of B-tree is determined by the disk I/O, that is, the number of node that will be loaded from disk to main memory. The comparision of the different values in one node is not counted.
Is it helpful? Yes No

Most helpful rated by users:

©2020 WithoutBook