论文信息 - The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues

The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues

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).

Svante Carlsson | S. Carlsson

[1] Nicola Santoro,et al. Min-max heaps and generalized priority queues , 1986, CACM.

[2] Svante Carlsson. A Variant of Heapsort with Almost Optimal Number of Comparisons , 1987, Inf. Process. Lett..

[3] Gaston H. Gonnet,et al. Heaps on Heaps , 1982, ICALP.

[4] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .