Skip Lists Explained: How Coin Flips Make Search Fast
The Geek Narrator · 26:26
Skip lists give you the fast O(log n) search of a sorted array and the cheap pointer-based insert and delete of a linked list. They do it by building "express lanes" over a linked list, and the lane heights come from...