Self-adjusting binary search trees
Journal of the ACM (JACM)
On the rotation distance in the lattice of binary trees
Information Processing Letters
Some properties of the rotation lattice of binary trees
The Computer Journal
A shortest path metric on unlabeled binary trees
Pattern Recognition Letters
On rotations in fringe-balanced binary trees
Information Processing Letters
Journal of Algorithms
Restricted rotation distance between binary trees
Information Processing Letters
Right-arm rotation distance between binary trees
Information Processing Letters
Bounding restricted rotation distance
Information Processing Letters
A direct algorithm for restricted rotation distance
Information Processing Letters
Theoretical Computer Science
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
k-Restricted rotation with an application to search tree rebalancing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Weak associativity and restricted rotation
Information Processing Letters
Root-restricted Kleenean rotations
Information Processing Letters
| Hi-index | 0.00 |
The splay tree is a well-known binary search tree with many remarkable properties. It is a self-adjusting data structure whose amortized performance matches any of the many forms of balanced search trees. Furthermore, splay trees are adaptive, and have superior performance in many specialized cases. It is a long-standing open problem whether splay trees are dynamically optimal. Most search tree algorithms are based on the fundamental rotation operation. In 2002 Cleary introduced the concept of restricted rotations, which severely limits where the rotation can be performed. We show that splaying can still be effected using only restricted rotations, while maintaining the same properties as regular splay trees.