Self-adjusting binary search trees
Journal of the ACM (JACM)
On the rotation distance in the lattice of binary trees
Information Processing Letters
The rotation graph of binary trees is hamiltonian
Journal of Algorithms
On the rotation distance of binary trees
Information Processing Letters
Some properties of the rotation lattice of binary trees
The Computer Journal
On the upper bound on the rotation distance of binary trees
Information Processing Letters
A shortest path metric on unlabeled binary trees
Pattern Recognition Letters
On rotations and the generation of binary trees
Journal of Algorithms
On the loopless generation of binary tree sequences
Information Processing Letters
Journal of Algorithms
Graph of triangulations of a convex polygon and tree of triangulations
Computational Geometry: Theory and Applications
Mental imagery in program design and visual programming
International Journal of Human-Computer Studies - Best of empirical studies of programmers 7
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
Theoretical Computer Science
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
Information Processing Letters
Rotational tree structures on binary trees and triangulations
Acta Cybernetica
Effective splaying with restricted rotations
International Journal of Computer Mathematics
Root-restricted Kleenean rotations
Information Processing Letters
| Hi-index | 0.89 |
In this paper we present a concise O(n) implementation of Cleary's algorithm for generating a sequence of restricted rotations between any two binary trees. The algorithm is described directly in terms of the binary trees, without using any intermediate representation.