By Topic

Constructing optimal search trees in optimal time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zheng, S.Q. ; Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA ; Sun, M.

(a, b)-trees are an important class of search trees. They include 2-3 trees, 2-3-4 trees, and B-trees as subclasses. We show that a space-minimum (a, b)-tree is also height-minimum and present an optimal algorithm for constructing (a, b)-trees that are height-minimum and space-minimum. Given n keys, our algorithm constructs an (a, b)-tree with minimum height and lowest possible nodes. Our algorithm takes Θ(n) time if the keys in S are sorted and Θ(n log n) time if the keys are not sorted. We also discuss possible applications of our algorithm

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 7 )