k-Restricted rotation distance between binary trees

Authors:
Fabrizio Luccio;Antonio Mesa Enriquez;Linda Pagli
Affiliations:
Dipartimento di Informatica, Università di Pisa, Italy;Facultad de Matemàtica y Computación, Universidad de la Habana, Cuba;Dipartimento di Informatica, Università di Pisa, Italy
Venue:
Information Processing Letters
Year:
2007

Citing 4
Cited 2

On the rotation distance of binary trees

Information Processing Letters
On the upper bound on the rotation distance of binary trees

Information Processing Letters
Restricted rotation distance between binary trees

Information Processing Letters
Bounding restricted rotation distance

Information Processing Letters

Weak associativity and restricted rotation

Information Processing Letters
Root-restricted Kleenean rotations

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The restricted rotation distanced"R(S,T) between two binary trees S, T of n vertices is the minimum number of rotations to transform S into T, where rotations take place at the root of S, or at the right child of the root. A sharp upper bound d"R(S,T)==3 is essentially open.