Randomized Skip List Summary

• Implements Dictionary ADT

  • insert in expected O(log n)
  • find in expected O(log n)
  • delete?

• Memory use

  • expected constant memory per node
  • about double a linked list

• Complexity?

Previous slide

Next slide

Back to first slide

View graphic version