Skip Navigation

The Computer Journal 1976 19(4):322-325; doi:10.1093/comjnl/19.4.322
© 1976 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 (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Walker, A.
Right arrow Articles by Wood, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Locally balanced binary trees*

A. Walker1 § and D. Wood2 ¶

1 Computel Systems, 1200 St. Laurent Boulevard, Ottawa, Ontario, Canada, 2 Computer Science Group, Department of Applied Mathematics, McMaster University, Hamilton, Ontario, Canada

The implementation of locally balanced binary search tree construction is described. Empirical investigation reveals that locally balanced trees are either superior or inferior to other more recent methods available in the literature, depending upon the chosen measurement criteria.

Received July 1974.

* Work carried out in part under an Imperial Oil Grant and in part under a National Research Council of Canada Grant No. A-7700.

§ Computel Systems, 1200 St. Laurent Boulevard, Ottawa, Ontario, Canada K1K 3B8.

Computer Science Group, Department of Applied Mathematics, McMaster University, Hamilton, Ontario, Canada.


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.