Skip lists are an efficient alternative to balanced trees, and rather easier to implement correctly.The skip list, described by William Pugh in "Skip Lists: A Probabilistic Alternative to Balanced Trees"
apppur / skiplist Goto Github PK
View Code? Open in Web Editor NEWSkip lists are an efficient alternative to balanced trees, and rather easier to implement correctly.The skip list, described by William Pugh in "Skip Lists: A Probabilistic Alternative to Balanced Trees"
License: MIT License