Abstract

Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space. The original paper on skip lists only presented algorithms for search, insertion and deletion. In this paper, we show that skip lists are as versatile as balanced trees. We describe and analyze algorithms to use search fingers, merge, split and concatenate skip lists, and implement linear list operations using skip lists. The skip list algorithms for these actions are faster and simpler than their balanced tree cousins. The merge algorithm for skip lists we describe has better asymptotic time complexity than any previously described merge algorithm for balanced trees. CR Categories and Subject Descriptors: E.1 [Data Structures]: Lists; F.1.2 [Models of Computation]: Probabilistic computation; F.2.2 [Nonnumeric...

Citations

279	Skip lists – a probabilistic alternative to balanced trees - Pugh - 1990
53	A new representation of linear lists - Guibas, McCreight, et al. - 1977
49	Design and analysis of a data structure for representing sorted lists - Brown, Tarjan - 1980
41	Sorting and Searching. The Art of - KNUTH - 1973
34	A Fast Merging Algorithm - Brown, Tarjan - 1979
31	Concurrent maintenance of skip lists - Pugh - 1990
21	Linear lists and priority queues as balanced binary trees - Crane - 1972