First page Back Continue Last page Summary Graphic
Splay Tree
Another, simpler, balancing scheme
- Standard binary tree are sufficient
- Balancing is based on a restructuring operation called splaying
Dowside
- It does not guarantee a O(log n) bound in the worst case. The bound is O(log n) in the amortized sense
Roadmap
- Describe & implement splay tree
- Analyze the O(log n) bound