Skip Lists:A Probabilistic Alternative to Balanced Trees

跳表,A Probabilistic Alternative to Balanced Trees.Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for ba