Skew binomial heap
In computer science, a skew binomial heap (or skew binomial queue) is a variant of the binomial heap that supports constant-time insertion operations in the worst case, rather than the logarithmic worst case and constant amortized time of the original binomial heap. Just as binomial heaps are based on the binary number system, skew binary heaps are based on the skew binary number system.[1]
References
- ^ Brodal, Gerth Stølting; Okasaki, Chris (November 1996), "Optimal purely functional priority queues", Journal of Functional Programming, 6 (6): 839–857, doi:10.1017/s095679680000201x
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |