, Volume 1, Issue 1, pp 111-129

First online:

The pairing heap: A new form of self-adjusting heap

  • Michael L. FredmanAffiliated withEECS Department, University of California
  • , Robert SedgewickAffiliated withComputer Science Department, Princeton University
  • , Daniel D. SleatorAffiliated withAT & T Bell Laboratories
  • , Robert E. TarjanAffiliated withComputer Science Department, Princeton UniversityAT & T Bell Laboratories

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue) called theFibonacci heap. Although theoretically efficient, Fibonacci heaps are complicated to implement and not as fast in practice as other kinds of heaps. In this paper we describe a new form of heap, called thepairing heap, intended to be competitive with the Fibonacci heap in theory and easy to implement and fast in practice. We provide a partial complexity analysis of pairing heaps. Complete analysis remains an open problem.

Key Words

Data structure Heap Priority queue