Splay Tree Summary
All operations are in amortized O(log n) time
Splaying can be done top-down; better because:
- only one pass
- no recursion or parent pointers necessary
There are alternatives to split/insert and join/delete
Splay trees are very effective search trees
- relatively simple
- no extra fields required
- excellent locality properties: frequently accessed keys are cheap to find