(data structure)
Definition: A binary search tree in which operations that access nodes restructure the tree.
Generalization (I am a kind of ...)
binary search tree.
Aggregate child (... is a part of or used in me.)
move-to-root heuristic.
Author: CLK
Daniel D. Sleator and Robert E. Tarjan, Self-Adjusting Binary Search Trees, Journal of the ACM, 32(3):652-686, 1985.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 7 June 2019.
HTML page formatted Fri Jun 7 13:58:22 2019.
Cite this as:
Chris L. Kuszmaul, "splay tree", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 7 June 2019. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/splaytree.html