Treap Summary

• Implements Dictionary ADT

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

• Memory use

  • O(1) per node
  • about the cost of AVL trees

• Complexity?

Previous slide

Next slide

Back to first slide

View graphic version