Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


A simple balanced search tree with 0(1) worst-case update time

Fleischer, Rudolf

MPI-I-92-101. January 1992, 10 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
In this paper we show how a slight modification of $(a,b)$-trees allows us to perform member and
neighbor queries in $O(\log n)$ time and updates in $O(1)$ worst-case time (once the position of the inserted or
deleted key is known).
Our data structure is quite natural and much simpler than previous worst-case optimal solutions.
It is based on two techniques :
1) \em{bucketing}, i.e.~storing an ordered list of $2\log n$ keys in each leaf of an $(a,b)$ tree, and \quad
2) \em{lazy splitting}, i.e.~postponing necessary splits of big nodes until we have time to handle them.
It can also be used as a finger tree with $O(\log^*n)$ worst-case update time.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s): KBytes; 50 KBytes; 121 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Fleischer, Rudolf},
  TITLE = {A simple balanced search tree with 0(1) worst-case update time},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-101},
  MONTH = {January},
  YEAR = {1992},
  ISSN = {0946-011X},