Updating almost complete trees or one level makes all the difference

  • Tony W. Lai
  • Derick Wood
Conference paper

DOI: 10.1007/3-540-52282-4_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 415)
Cite this paper as:
Lai T.W., Wood D. (1990) Updating almost complete trees or one level makes all the difference. In: Choffrut C., Lengauer T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg

Abstract

An almost complete (or 2-complete) tree is a binary search tree in which any two external nodes are no more than two levels apart. While complete binary search trees have an amortized update cost of Θ(n), we demonstrate that almost complete binary search trees have an amortized update cost of O(log2n). Thus, they are an attractive alternative for those situations that require fast retrieval, that is, log n+O(1) comparisons, and have few updates.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Tony W. Lai
    • 1
  • Derick Wood
    • 1
  1. 1.Data Structuring Group Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations