Optimal finger search trees in the pointer machine

https://doi.org/10.1016/S0022-0000(03)00013-8Get rights and content
Under an Elsevier user license
open archive

Abstract

We develop a new finger search tree with worst-case constant update time in the pointer machine (PM) model of computation. This was a major problem in the field of Data Structures and was tantalizingly open for over 20 years, while many attempts by researchers were made to solve it. The result comes as a consequence of the innovative mechanism that guides the rebalancing operations, combined with incremental multiple splitting and fusion techniques over nodes.

Keywords

Balanced search trees
Data structures
Complexity

Cited by (0)

A preliminary version of this paper was presented in STOC 2002.

1

Research conducted while visiting Computer Technology Institute (CTI) and University of Patras, Greece.

2

Funded by the Danish National Research Foundation.