Set of efficient data structures based on skip lists.
npm install skipstruct
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.
— William Pugh, Concurrent Maintenance of Skip Lists (1989)
Provided skip list implementation is the most efficient out there in terms of memory and CPU consumption. What makes it so good is a custom pointer system originally described by Guillaume Plique.
Read more on the website.