Optimal bounds on the dictionary problem

  • Arne Andersson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)


A new data structure for the dictionary problem is presented. Updates are performed in Γ(log n) time in the worst case and the number of comparisons per operation is ⌈log n + 1 + ∈⌉, where ε is an arbitrary positive constant.


Binary Tree Binary Search Tree Insertion Algorithm Arbitrary Positive Constant Unary Neighbour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. M. Adelson-Velski and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2), 162.Google Scholar
  2. [2]
    A. Andersson. Binary search trees of almost optimal height. tech. report, Department of Computer Science, Lund University, 1988.Google Scholar
  3. [3]
    R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4), 1972.Google Scholar
  4. [4]
    H. A. Mauer, Th. Ottman, and H. W. Six. Implementing dictionaries using binary trees of very small height. Information Processing Letters, 5(1), 1976.Google Scholar
  5. [5]
    J. Nievergelt and E. M. Reingold. Binary trees of bounded balance. SIAM Journal on Computing, 2(1), 1973.Google Scholar
  6. [6]
    J. van Leeuwen and M. H. Overmars. Stratified balanced search trees. Acta Informatica, 18, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

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

Personalised recommendations