A note on the construction of the data structure “deap”
- 1 June 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (6) , 315-317
- https://doi.org/10.1016/0020-0190(89)90094-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The deap—a double-ended heap to implement double-ended priority queuesInformation Processing Letters, 1987
- Bounds for min-max heapsBIT Numerical Mathematics, 1987
- Min-max heaps and generalized priority queuesCommunications of the ACM, 1986
- A data structure for manipulating priority queuesCommunications of the ACM, 1978
- Algorithm 245: TreesortCommunications of the ACM, 1964
- AlgorithmsCommunications of the ACM, 1964