Skew binomial heap
A skew binomial heap (or skew binomial queue) is a variant of the binomial heap that supports worst-case O(1) insertion, rather than the O(lg n) worst-case insertion from 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]
- ^ Okasaki, Chris. Purely Functional Data Structures.
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (January 2011) |