On Rotations and the Generation of Binary Trees

  title={On Rotations and the Generation of Binary Trees},
  author={Joan M. Lucas and Dominique Roelants van Baronaigien and Frank Ruskey},
  journal={J. Algorithms},
The rotation graph, G n , has vertex set consisting of all binary trees with n nodes. Two vertices are connected by an edge if a single rotation will transform one tree into the other. We provide a simpler proof of a result of Lucas 7] that G n contains a Hamilton path. Our proof deals directly with the pointer representation of the binary tree. This proof provides the basis of an algorithm for generating all binary trees that can be implemented to run on a pointer machine and to use only… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 23 references

Arbitrary splitting in splay trees

J. Lucas
Dept. of Computer Science, Rutgers Univ., Tech. Report 234 • 1988
View 12 Excerpts
Highly Influenced

Some Properties of the Rotation Lattice of Binary Trees

Comput. J. • 1988
View 11 Excerpts
Highly Influenced

Ranking Trees Generated by Rotations

SWAT • 1990
View 3 Excerpts
Highly Influenced

A Hamilton path in the rotation lattice of binary trees

D. Roelants van Baronaigien, F. Ruskey
Congressus Numerantium, • 1987
View 6 Excerpts
Highly Influenced

akinen. Left distance binary tree

M Erkki
representations. BIT, • 1987
View 7 Excerpts
Highly Influenced

Enumerating, Ranking and Unranking Binary Trees

Comput. J. • 1986
View 9 Excerpts
Highly Influenced

Generating Binary Trees Using Rotations

J. ACM • 1985
View 8 Excerpts
Highly Influenced

Sequential access in play trees takes linear time

Combinatorica • 1985
View 5 Excerpts
Highly Influenced

Lexicographic Generation of Ordered Trees

Theor. Comput. Sci. • 1980
View 8 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…