Indexing with Binary Search Trees: Negative Aspects
A sorted list can be expressed in a Binary Search Tree representation.
However, there are 2 problems with binary search trees:
- They are not fast enough for disk resident indexing.
- There is no effective strategy of balancing the tree.
?We will look at 2 solutions: AVL Trees and Paged Binary Trees.