Jump to content

Skew binomial heap

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2a02:810d:d40:4870:b4b0:bd55:b926:760b (talk) at 06:24, 22 August 2016 (Add link to Okasaki’s thesis). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, 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(log 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]

References

  1. ^ Okasaki, Chris. Purely Functional Data Structures.
Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Skew_binomial_heap&oldid=735656540"