Skip Navigation

The Computer Journal 1989 32(5):470-473; doi:10.1093/comjnl/32.5.470
© 1989 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 (4)
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?

A New Algorithm for Generating Binary Trees using Rotations

M. C. Er *

Department of Computer Science, The University of Western Australia, Nedlands, WA 6009, Australia

A new formulation for generating all binary trees with n nodes by using tree rotations is presented. Such a new formulation is based on a detailed study of the properties of codewords with (n-1) non-negative integers that are called rotational admissible. A 1 - 1 correspondence between a set of binary trees with n nodes and a set of rotational admissible codewords with (n-1) integers is formally established. As a results, simple and efficient algorithms for generating rotational-admissible codewords and for generating binary trees using rotations are derived. An empirical test reveals that both algorithms run faster than the corresponding Zerling's algorithms for performing the same task.

Received October 1986. revised May 1987.

* Department of Computer Science, The University of Western Australia, Nedlands, WA 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.