An Implicit Binomial Queue with Constant Insertion Time

Svante Carlsson, J. Ian Munro, Patricio V. Poblete

Abstract: We introduce a new representation of a priority queue in an array such that the operation of insert can be performed in constant time and minimum extraction in logarithmic time. In developing this structure we first introduce a very simple scheme permitting insertions in constant amortized time. This is modified to achieve the worst-case behavior using roughly lg*n pairs of pointers, and finally this pointer requirement is removed.