Right-arm rotation distance between binary trees

Authors:
Jean Marcel Pallo
Affiliations:
UMR LE.2.I., Université de Bourgogne, BP 47870 F21078 Dijon Cedex, France
Venue:
Information Processing Letters
Year:
2003

Citing 4
Cited 10

On the rotation distance in the lattice of binary trees

Information Processing Letters
Lower bounds for accessing binary search trees with rotations

SIAM Journal on Computing
A shortest path metric on unlabeled binary trees

Pattern Recognition Letters
Restricted rotation distance between binary trees

Information Processing Letters

A direct algorithm for restricted rotation distance

Information Processing Letters
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations

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
Note: Refined upper bounds for right-arm rotation distances

Theoretical Computer Science
Effective splaying with restricted rotations

International Journal of Computer Mathematics
The pruning-grafting lattice of binary trees

Theoretical Computer Science
Weak associativity and restricted rotation

Information Processing Letters
Root-restricted Kleenean rotations

Information Processing Letters
Motzkin subposets and Motzkin geodesics in Tamari lattices

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider a transformation on binary trees, named right-arm rotation, which is a special instance of the well-known rotation transformation. Only rotations at nodes of the right arm of the trees are allowed. Using ordinal tools, we give an efficient algorithm for computing the right-arm rotation distance between two binary trees, i.e., the minimum number of rightarm rotations necessary to transform one tree into the other.