Skip Lists:A Probabilistic Alternative to Balanced Trees

【文件属性】：

文件名称：Skip Lists:A Probabilistic Alternative to Balanced Trees

文件大小：892KB

文件格式：PDF

更新时间：2014-12-26 03:53:46

跳表 Skip Lists

跳表，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 balanced trees.