A pointer-free data structure for merging heaps and min-max heaps (Q1177934): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126352146, #quickstatements; #temporary_batch_1722442319438 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126352146 / rank | |||
Normal rank | |||
Latest revision as of 17:14, 31 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A pointer-free data structure for merging heaps and min-max heaps |
scientific article |
Statements
A pointer-free data structure for merging heaps and min-max heaps (English)
0 references
26 June 1992
0 references
A data structure is introduced which makes it possible to represent different instances of mergeable priority queues and dequeues within the same array and at the same time. A pointer-free data structure is developed for mergeable heaps and min-max heaps under which the basic operations of Deletemax, Deletemin, Findmax, Findmin, Merge, Newheap and Deleteheap are performed in \(O(1)\) amortized time for each operation and an Insert operation in \(O(\log n)\) time.
0 references
merging
0 references
pointer-free data structure
0 references
heaps
0 references
0 references
