Binomial Queue Summary

• Implements priority queue ADT

  • Insert in amortized O(1) time
  • FindMin (with some tricks) in O(1) time
  • DeleteMin in O(log n) time
  • Merge in O(log n) time

• Memory use

  • O(1) per node
  • about the cost of skew heaps

• Complexity?

Previous slide

Next slide

Back to first slide

View graphic version