Range-restricted mergeable priority queues (Q689640)

We define a new class of mergeable heaps that we call \(H\)-heaps. Using \(H\)-Heaps we can process an on-line sequence of mergeable priority queue operations when the elements are integers in the range \(1,\ldots,N\) in amortized time \(O(\log \log N)\) and worst-case time \(O(\log N)\) per operation.