Skew binomial heap

Skew binomial heap
Typeheap
Invented1996
Invented byGerth Stølting Brodal and Chris Okasaki
Time complexity in big O notation
Operation Average Worst case
Insert Θ(1) Θ(1)
Find-min Θ(1)
Delete-min O(log n)
Decrease-key O(log n)
Merge O(log n)
Space complexity

In computer science, a skew binomial heap (or skew binomial queue) is a data structure for priority queue operations. It is a variant of the binomial heap that supports constant-time insertion operations in the worst case, rather than amortized time.