8
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Time- and Space-optimal height-balanced 2-3 brother trees

, &
Pages 171-188 | Received 01 Sep 1982, Published online: 08 Jun 2010
 

Abstract

The node-visit optimal (NVO) and the space-cost optimal (SCO) height-balanced (HB) 2-3 brother trees are defined. The characterization of the NVO HB 2-3 brother trees is developed. This characterization leads to a linear-time algorithm for constructing an NVO HB 2-3 brother tree for an ordered set of keys. The minimum space-cost of an N-key NVO HB2-3 brother tree and the space-cost of an N-key SCO HB 2-3 brother tree is analysed. It is shown that the minimum space-cost of an NVO HB 2-3 brother tree is never more than one plus the space-cost of an SCO HB 2-3 brother tree. Further, the minimum node-visit cost of an SCO HB 2-3 brother tree is at most one plus the node-visit cost of an NVO HB 2-3 brother tree. It is also shown that there exists an HB 2-3 brother tree which is both SCO and NVO for just over half the possible values of keys. Finally, an outline for constructing an SCO HB 2-3 brother tree is presented.

C.R. Categories::

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.