Skip Navigation

The Computer Journal 1985 28(5):538-542; doi:10.1093/comjnl/28.5.538
© 1985 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 (17)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by ER, M. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Enumerating Ordered Trees Lexicographically

M. C. ER *

Department of Computer Science, University of Western Australia, Nedlands, W.A. 6009, Australia

A 1-1 mapping between the set of extended ordered trees with n internal nodes and the set of feasible binary bit-patterns with 2n bits is established. By manipulating the feasible bit-patterns, the set of ordered trees with n nodes can be enumerated lexicographically. The ranking and unranking functions are also described. It has been shown that the bit-pattern representation of ordered trees leads to simple construction and easy understanding of the enumerating, ranking and unranking algorithms.


* Department of Computer Science, University of Western Australia, Nedlands, W.A. 6009, Australia


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.