Perfect Binary Skip List

• Sorted linked list

• # of links of a node is its height

• The height i link of each node (that has one) links to the next node of height i or greater

8

2

11

10

19

13

20

22

29

23

Previous slide

Next slide

Back to first slide

View graphic version