By Topic

On the Height of Multidimensional Height-Balanced Trees

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

1 Author(s)
Vaishnavi, V.K. ; Department of Computer Information Systems, Georgia State University

It is shown that the worst case height of a k- dimensional height-balanced tree, k ≥ 2, is the same as that of an AVL-tree, to within an additive factor of 2k − 2.

Published in:

Computers, IEEE Transactions on  (Volume:C-35 ,  Issue: 9 )