Skip Navigation

The Computer Journal 1988 31(3):269-274; doi:10.1093/comjnl/31.3.269
© 1988 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by van der Weide, T. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Iterative Tree Traversal using Refinements and Pointer Rotation

T. P. van der Weide *

Katholieke Universiteit Nijmegen, Toernooiveld, 6525 ED Nijmegen, The Netherlands

This paper concerns the didactic use of refinements and pointer rotation in the derivation of iterative traversal algorithms according to a given specification. The concept of tree transformation provides a high-level view on (non-recursive) tree traversal. Tree transformations can be realised by using the concept of pointer rotation.

Received June 1986. revised November 1986.

* Katholieke Universiteit Nijmegen, Toernooiveld, 6525 ED Nijmegen, The Netherlands


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.