Indexing with Binary Search Trees: Positive Aspects
Tree structures give us an important new capability: we no longer have to sort the file to perform a binary search.
To add a new key, we simply link it to the appropriate leaf node.
If the tree remains balanced, then the search performance on this tree is good.
Problems occur when the tree gets unbalanced.
? We will look for schemes that allow trees to remain balanced