Find in a Perfect Binary Skip List

• Start i at the maximum height

• Until the node is found or i is one and the next node is too large:

  • If the next node along the i link is less than the target, traverse to the next node
  • Otherwise, decrease i by one

runtime:

Previous slide

Next slide

Back to first slide

View graphic version