Improving partial rebuilding by using simple balance criteria

  • Arne Andersson
Conference paper

DOI: 10.1007/3-540-51542-9_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)
Cite this paper as:
Andersson A. (1989) Improving partial rebuilding by using simple balance criteria. In: Dehne F., Sack J.R., Santoro N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg

Abstract

Some new classes of balanced trees, defined by very simple balance criteria, are introduced. Those trees can be maintained by partial rebuilding at lower update cost than previously used weight-balanced trees. The used balance criteria also allow us to maintain a balanced tree without any balance information stored in the nodes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Arne Andersson
    • 1
  1. 1.Department of Computer ScienceLund UniversityLundSweden

Personalised recommendations