Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time

Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen

The binary heap of Williams (1964) is a simple priority queue characterized by only storing an array containing the elements and the number of elements $n$ - here denoted a strictl…