Skip Navigation

The Computer Journal 1975 18(3):227-230; doi:10.1093/comjnl/18.3.227
© 1975 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 (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Burkhard, W. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nonrecursive traversals of trees*

W. A. Burkhard §

Computer Science Division, Department of Applied Physics and Information Science, University of California, San Diego, La Jolla, California, USA

Efficient, nonrecursive algorithms are given for postorder, symmetric order, and preorder traversals of binary trees. In particular, the algorithms require only a fixed amount of space independent of tree size. The binary trees are implemented as an ordered natural implementation with no extra flag fields. The traversal algorithms each run in time proportional to the tree size. Proofs of correctness for the three algorithms are presented.

Received September 1973.

* This work was supported in par by the National Science Foundation Grant GJ-34655

§ Computer Science Division, Department of Applied Physics and Information Science, University of California, San Diego, La Jolla, California 92037, USA


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.