Skip Navigation

The Computer Journal 1990 33(5):471-472; doi:10.1093/comjnl/33.5.471
© 1990 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Andersson, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

A Note on the Expected Behaviour of Binary Tree Traversals

A. Andersson

Department of Computer Science, Lund University, Lund, Sweden

Brinck and Foo1,2 have analysed tree traversal algorithms using threads and stack. In this note we show that, contrary to the results in the two referred papers, a preorder traversal is performed faster with a stack than with threads, in terms of pointer assignments. Moreover, the preorder-stack traversal is faster than any of the other standard traversals analysed in Refs 1 and 2.

Received April 1989.


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.