Skip to main content
Springer Nature Link
Log in

Height-analysis ofk-dimensional leaf and node height-balanced trees: A new approach

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A new general approach is proposed for the height-analysis ofk-dimensional leaf and node height-balanced trees which is expected to be useful for such analysis of other neighbor-supported balanced multidimensional trees as well. The approach leads to upper bounds which are the same as the known upper bounds for the corresponding 1-dimensional trees, to within an additive term.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Luccio and L. Pagli,On the height of height-balanced trees, IEEE Trans. Comput., Vol. 25, pp. 87–90, 1976.

    Google Scholar 

  2. S. S. Iyengar, N. S. V. Rao, R. L. Kashyap, and V. K. Vaishnavi,Multidimensional data structures: Review and outlook, Advances in Computers, Vol. 27, pp. 69–119, 1988.

    Google Scholar 

  3. V. K. Vaishnavi,Multidimensional height-balanced trees, IEEE Trans. Comput., Vol. 33, pp. 334–343, 1984.

    Google Scholar 

  4. V. K. Vaishnavi,On the height of multidimensional height-balanced trees, IEEE Trans. Comput., Vol. 35, pp. 773–780, 1986.

    Google Scholar 

  5. V. K. Vaishnavi,Weight leaf AVL-trees, SIAM J. Comput. Vol. 16, pp. 503–537.

  6. V. K. Vaishnavi,Multidimensional balanced binary trees, IEEE Trans. Comput., Vol. 38, pp. 968–985, 1989.

    Google Scholar 

  7. V. K. Vaishnavi,On k-dimensional balanced binary trees, Computer Information Systems Report CIS-89-002, Department of Computer Information Systems, Georgia State University, 1989.

  8. V. K. Vaishnavi and T. D. Korson,Height-analysis of k-dimensional leaf and node height-balanced trees: a new approach, Computer Information Systems Technical Report CIS-89-001, Department of Computer Information Systems, Georgia State University, 1989.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Information Systems, Georgia State University, 30303, Atlanta, Georgia, USA

    Vijay K. Vaishnavi & Timothy D. Korson

  2. Department of Computer Science, Clemson University, 29634, Clemson, South Carolina, USA

    Vijay K. Vaishnavi & Timothy D. Korson

Authors
  1. Vijay K. Vaishnavi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Timothy D. Korson
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This research is partially supported by a grant from the College of Business Administration, Georgia State University, Atlanta, Georgia.

Actually a variant calledalmost 2-dimensional leaf AVL-trees is introduced in order to facilitate the derivation of an upper bound for the height of these trees which is within an additive term to the bound for such 1-dimensional trees.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vaishnavi, V.K., Korson, T.D. Height-analysis ofk-dimensional leaf and node height-balanced trees: A new approach. BIT 31, 36–49 (1991). https://doi.org/10.1007/BF01952781

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01952781

CR subject classification

Keywords