Jump to content

Skew binomial heap

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Andreas Kaufmann (talk | contribs) at 08:14, 14 May 2011 (removed Category:Data structures; added Category:Heaps (structure) using HotCat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

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