Thinking about Binary Search Trees
Observations
- Each operation views two new elements at a time
- Elements (even siblings) may be scattered in memory
- Binary search trees are fast if they’re shallow
Realities
- For large data sets, disk accesses dominate runtime
- Some deep and some shallow BSTs exist for any data