| Skew binomial heap | |||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Type | heap | ||||||||||||||||||||||||||
| Invented | 1996 | ||||||||||||||||||||||||||
| Invented by | Gerth Stølting Brodal and Chris Okasaki | ||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
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.