Skip Navigation

The Computer Journal 1977 20(4):350-352; doi:10.1093/comjnl/20.4.350
© 1977 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 (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Soule, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A note on the nonrecursive traversal of binary trees

S. Soule *

Department of Computer Science, The University of Calgary, 2920 24 Ave. N W, Calgary, Canada

A nonrecursive procedure is developed for traversing unthreaded binary trees in a fixed space and in time proportional to tree size. Burkhard (1975) gives a way to do this without requiring a tag field, but with the requirement that descendent nodes have greater addresses than parents. Knuth (1968) gives a way to do such a traverse but requires a tag field. This paper develops one program that realises either variation (for preorder, symmetric order or endorder traversal for tagged or ordered trees). The development is based on a careful, stepwise rewriting of a simple traversal program, confirming Knuth's claim (1974) that program manipulation is a useful technique for program development.

Received March 1976.

* Department of Computer Science, The University of Calgary, 2920 24 Ave. N W, Calgary, Canada T2N 1N4


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.