Optimal bounds on the dictionary problem
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.
KeywordsBinary Tree Binary Search Tree Insertion Algorithm Arbitrary Positive Constant Unary Neighbour
Unable to display preview. Download preview PDF.
- G. M. Adelson-Velski and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2), 162.Google Scholar
- A. Andersson. Binary search trees of almost optimal height. tech. report, Department of Computer Science, Lund University, 1988.Google Scholar
- R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4), 1972.Google Scholar
- 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
- J. Nievergelt and E. M. Reingold. Binary trees of bounded balance. SIAM Journal on Computing, 2(1), 1973.Google Scholar
- J. van Leeuwen and M. H. Overmars. Stratified balanced search trees. Acta Informatica, 18, 1983.Google Scholar