Question

What are the advantages and disadvantages of B-star trees over Binary trees.?

Answer 1

ibdij kyfdc oigbv iybdచన ఛెఎశ ఝబసద జఫ ఝ

Answer 2

hello!!

From better research I think this will help u..

hope it helps:-

● B-star trees have better data structure and are faster in search than Binary trees, but its harder to write codes for B-start trees.

● 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.