Splay Tree
No explicit balance metadata is required.
Amortized operation complexity: O(log n).
Worst-case individual operation: O(n).
Frequently accessed elements tend to move near the root.
Useful when temporal or spatial locality is important.
Share via WhatsApp, X, Facebook, LinkedIn or copy link. Open Graph preview enabled.