Skip Navigation


The Computer Journal Advance Access originally published online on May 3, 2005
The Computer Journal 2005 48(4):488-497; doi:10.1093/comjnl/bxh110
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
48/4/488    most recent
bxh110v1
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 (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Korsh, J. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org

Generating T-ary Trees in Linked Representation

James F. Korsh *

Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA

This paper presents a new algorithm for the generation of all n node t-ary trees in linked representation. It also gives two constant average time implementations of the algorithm. The first directly generates the next tree from its predecessor while the second retains additional information about the predecessor and is faster for t > 4.

Received 11 March 2004. revised 11 March 2005.

* Email: korsh{at}temple.edu


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.