Review: Skip Lists
l The basic idea:
l Keep a doubly-linked list of elements
n Min, max, successor, predecessor: O(1) time
n Delete is O(1) time, Insert is O(1)+Search time
l Add each level-i element to level i+1 with
probability p (e.g., p = 1/2 or p = 1/4)