Skip Navigation

The Computer Journal 1991 34(5):406-414; doi:10.1093/comjnl/34.5.406
© 1991 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 Smyth, W. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Mu-balancing M-way Search Trees

W. F. Smyth *

Department of Computer Science and Systems, McMaster University, 1280 Main Street West, Hamilton, Ontario, Canada L8S 4K1

A recent paper by Stout and Warren describes an asymptotically optimal algorithm (using {theta}(N) time and constant space) for the balancing of binary search trees on N vertices. This paper shows how to extend their algorithm to balance M-way search trees, M >= 2, using O(MN) time and O(M) temporary work space (consisting essentially of one node of the tree). The time bound (at least) is asymptotically optimal in cases of practical interest. When the M-way tree is stored on disc as the directory of an indexed sequential file, the algorithm uses at most 6N disc accesses (for large M) and requires that at most three nodes of the tree be simultaneously available in main memory. Various options for implementation of the algorithm are discussed, which allow the user to influence certain characteristics of the final balanced tree; in particular, to balance using MU < M – 1 keys per node.

Received October 1987. revised March 1988.

* Department of Computer Science and Systems, McMaster University, 1280 Main Street West, Hamilton, Ontario, Canada L8S 4K1


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.