Skip Navigation

The Computer Journal 1988 31(6):564-565; doi:10.1093/comjnl/31.6.564
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (14)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pallo, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short notes

Some Properties of the Rotation Lattice of Binary Trees

J. Pallo *

Departement d'Informatique, Universite de Bourgogne, B.P. 138, 21004, Dijon, France

We study special elements of the rotation lattice of binary ordered trees introduced in a previous paper.3 In this lattice, we point out a Boolean sublattice. Rotation is generalised to binary unordered trees.

Received March 1988.

* Département d'Informatique, Université de Bourgogne B.P. 138 21004 Dijon France


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.