Performance

• Expected worst case search cost:

O(log n)

• Space requirements:

  • M*(|key| + |info|)

• Deletions:

  • By marking
  • By deleting the item and reinserting all items in the chain.

Previous slide

Next slide

Back to first slide

View graphic version