A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very quickly searchable (Skiena 1997, p. 177).
Splay Tree
See also
TreeExplore with Wolfram|Alpha
References
Skiena, S. S. The Algorithm Design Manual. New York: Springer-Verlag, pp. 177 and 179, 1997.Sleator, D. and Tarjan, R. "Self-Adjusting Binary Search Trees." J. ACM 32, 652-686, 1985.Tarjan, R. Data Structures and Network Algorithms. Philadelphia, PA: SIAM Press, 1983.Wood, D. Data Structures, Algorithms, and Performance. Reading, MA: Addison-Wesley, 1993.Referenced on Wolfram|Alpha
Splay TreeCite this as:
Weisstein, Eric W. "Splay Tree." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SplayTree.html