Finger Search Trees with Constant Insertion Time

We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at any arbitrary element f in the list, only requires logarithmictime in the distance between x and f in the list. We present the rst pointer-based implementation of nger search trees allowing new elements to be inserted at any arbitrary position in the list in worst case constant time. Previously, the best knowninsertion time on the pointer machine was O(log n), where n is the total length of the list. On a unit-cost RAM, a constant insertion time has been achieved by Dietz and Raman by using standard techniques of packing small problem sizes into a constant number of machine words. Deletion of a list element is supported in O(log n) time, which matches the previous best bounds. Our data structure requires linear space.

• Type: Conference
• Year: 1998
• Where: SODA
• Authors: Gerth Stølting Brodal
• Keywords: Algorithms, Case Constant Time, Nger Search Trees, Pointer Machine, SODA 1998