Skip Navigation

The Computer Journal 1981 24(2):148-155; doi:10.1093/comjnl/24.2.148
© 1981 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 (12)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Brinck, K.
Right arrow Articles by Foo, N. Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Analysis of algorithms on threaded trees

K. Brinck * and N. Y. Foo *

Basser Department of Computer Science, University of Sydney, Sydney, Australia

This paper investigates the performances of various algorithms operating on binary trees. In particular the expected times necessary to compute the different successor and predecessor nodes of a random node in a random threaded binary tree are presented. Based on these results it is then shown that the inorder traversal algorithm using threads is about 25% better performing than the corresponding algorithm using stacks, while for preorder and postorder little or no improvement in traversal times is gained by the use of threads. Finally the presence of threads in a binary tree is briefly discussed with respect to the performance of insertion and deletion algorithms.

Received May 1979. revised September 1980.

* Basser Department of Computer Science, University of Sydney, Sydney, NSW 2006, Australia


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.