A pointer-free data structure for merging heaps and min-max heaps (Q1177934)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 22505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A pointer-free data structure for merging heaps and min-max heaps |
scientific article; zbMATH DE number 22505 |
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
0.8265072703361511
0 references
0.819837749004364
0 references
0.7946012616157532
0 references
0.7879356741905212
0 references
