This is a library implementing skip lists as first described in Skip lists: a probabilistic alternative to balanced trees for the Go programming language.

Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as a result the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.