Splay trees are self-adjusting binary search trees which were invented by Sleator and Tarjan [JACM 1985]. This entry provides executable and verified functional splay trees as well as the related splay heaps (due to Okasaki).
The amortized complexity of splay trees and heaps is analyzed in the AFP entry Amortized Complexity.
- July 12, 2016
- Moved splay heaps here from Amortized_Complexity
- Splay Trees in Functional Algorithms, Verified!