Skip Navigation

The Computer Journal 1986 29(2):171-175; doi:10.1093/comjnl/29.2.171
© 1986 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 (51)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pallo, J. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Enumerating, Ranking and Unranking Binary Trees

J. M. Pallo *

Departement d'Informatique, Universite de Dijon, Bp 138, F21004 Dijon, France

We introduce weight sequences, which are sequences of positive integers characterising binary trees, in order to generate lexicographically binary trees as a list. Algorithms are developed to determine the position of a given weight sequence, and to generate the weight sequence of a given position. We also use weight sequences in order to study a transformation on binary trees. Furthermore, we make a link with term rewriting systems.

Received January 1984.

* Département d'Informatique, Université de Dijon, Bp 138, F21004 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.