Database Indexing with B-Trees

B-trees are simpler to implement than binary trees B-trees have a high branching factor that keeps the tree shallow, minimizing the number of slow disk I/O operations needed for lookups Binary search trees cannot store strings, only integers B-trees guarantee O(1) lookup time, while BSTs are O(log n)