What are the advantages and disadvantages of B-star trees over Binary trees?
What are the advantages and disadvantages of B-star trees over Binary trees?
✍: Guest
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.
2012-04-13, 4149👍, 0💬
Related Topics:
