C%20%20%20Interview%20Questions%20and%20Answers
Question: What are the advantages and disadvantages of B-star trees over Binary trees?
Answer: 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:
- What is C++?
- What is function overloading and operator overloading?
- How do you find out if a linked-list has an end? (i.e. the list is not a cycle)
- What is the difference between declaration and definition?
- What is the difference between realloc() and free()?