, Volume 1, Issue 1, pp 111–129

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


  • Michael L. Fredman
    • EECS DepartmentUniversity of California
  • Robert Sedgewick
    • Computer Science DepartmentPrinceton University
  • Daniel D. Sleator
    • AT & T Bell Laboratories
  • Robert E. Tarjan
    • Computer Science DepartmentPrinceton University
    • AT & T Bell Laboratories

DOI: 10.1007/BF01840439

Cite this article as:
Fredman, M.L., Sedgewick, R., Sleator, D.D. et al. Algorithmica (1986) 1: 111. doi:10.1007/BF01840439


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 structureHeapPriority queue

Copyright information

© Springer-Verlag 1986