On the rotation distance in the lattice of binary trees
Information Processing Letters
On the rotation distance of binary trees
Information Processing Letters
Lower bounds for accessing binary search trees with rotations
SIAM Journal on Computing
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
Finite pseudocomplemented lattices
European Journal of Combinatorics
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
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 |
A rotation in a binary tree is a simple and local restructuring technique commonly used in computer science. We propose in this paper three restrictions on the general rotation operation. We study the case when only leftmost rotations are permitted, which corresponds to a natural flipping on polygon triangulations. The resulting combinatorial structure is a tree structure with the root as the greatest element. We exhibit an efficient algorithm for computing the join of two trees and the minimum number of leftmost rotations necessary to transform one tree into the other.