Elsevier

Information Processing Letters

Volume 26, Issue 1, 15 September 1987, Pages 33-36
Information Processing Letters

The deap—a double-ended heap to implement double-ended priority queues

https://doi.org/10.1016/0020-0190(87)90033-0Get rights and content

Abstract

This paper presents a symmetrical implicit double-ended priority queue implementation, which can be built in linear time. The smallest and the largest element can be found in constant time, and deleted in logarithmic time. This structure is an improvement of the MinMaxHeap presented by Atkinson et al. (1986).

References (7)

  • S. Carlsson

    A variant of Heapsort with almost optimal number of comparisons

    Inform. Process. Lett.

    (1987)
  • M.D. Atkinson et al.

    Min-Max heaps and generalized priority queues

    Comm. ACM

    (1986)
  • S. Carlsson

    Deap—a double-ended heap to implement double-ended priority queues

    Tech. Rept. CODEN: LUNFD6⧸(NFCS-3011)⧸(1–7)

    (1986)
There are more references available in the full text version of this article.

Cited by (34)

  • Reflected min-max heaps

    2003, Information Processing Letters
  • A survey on priority queues

    2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View all citing articles on Scopus
View full text