Skip List

Get O(log n) search, insert, and delete on an ordered set using stacked linked lists and a coin flip instead of tree rotations. Build randomized levels, express-lane insertion that keeps the list sorted, fast search, and deletion — the structure behind Redis sorted sets and LevelDB memtables.