Performance

• Expected worst case search cost:

O(log n)

• Space requirements:

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

• Deletions:

  • Only by marking.

Previous slide

Next slide

Back to first slide

View graphic version