Skip Navigation

The Computer Journal 2002 45(6):653-660; doi:10.1093/comjnl/45.6.653
© 2002 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 Siltaneva, J.
Right arrow Articles by Mäkinen, E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Comparison of Random Binary Tree Generators

Jarmo Siltaneva1 and Erkki Mäkinen2

1 Information Technology Center, City of Tampere, Lenkkeilijänkatu 8, Finn-Medi 2, FIN-33520 Tampere, Finland Email: em@cs.uta.fi 2 Department of Computer and Information Sciences, PO Box 607, FIN-33014 University of Tampere, Finland Email: Jarmo.Siltaneva@tt.tampere.fi

This paper empirically compares five linear-time algorithms for generating unbiased random binary trees. More specifically, we compare the relative asymptotic performance of the algorithms in terms of the numbers of various basic operations executed on average per tree node. Based on these numbers a ranking of the algorithms, which depends on the operation weights, can be deduced. A definitive ranking of the algorithms, however, hardly exists.

Received 1 January, 2002. Revised 15 May, 2002.


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.