Skip to content

1.5 Heaps and Priority Queues

Binary, d-ary, Fibonacci, pairing, soft heaps, double-ended structures, tournament trees, and concurrent priority queue designs.

indexslugname
1binary-heapBinary Heap
2min-heapMin Heap
3max-heapMax Heap
4heap-insertHeap Insert
5heap-extract-minExtract Minimum
6heap-extract-maxExtract Maximum
7heap-peekHeap Peek
8heap-sift-upSift Up
9heap-sift-downSift Down
10heapifyHeapify
11bottom-up-heap-constructionBottom-Up Heap Construction
12top-down-heap-constructionTop-Down Heap Construction
13heap-replaceHeap Replace
14heap-push-popHeap Push Pop
15heap-decrease-keyDecrease Key
16heap-increase-keyIncrease Key
17heap-deleteHeap Delete
18heap-update-keyUpdate Key
19d-ary-heapD-ary Heap
20ternary-heapTernary Heap
21quaternary-heapQuaternary Heap
22binomial-heapBinomial Heap
23fibonacci-heapFibonacci Heap
24pairing-heapPairing Heap
25leftist-heapLeftist Heap
26skew-heapSkew Heap
27rank-pairing-heapRank Pairing Heap
28hollow-heapHollow Heap
29soft-heapSoft Heap
30treap-priority-queueTreap Priority Queue
31bucket-priority-queueBucket Priority Queue
32radix-heapRadix Heap
33calendar-queueCalendar Queue
34indexed-priority-queueIndexed Priority Queue
35addressable-priority-queueAddressable Priority Queue
36meldable-priority-queueMeldable Priority Queue
37bounded-priority-queueBounded Priority Queue
38double-ended-priority-queueDouble-Ended Priority Queue
39min-max-heapMin-Max Heap
40interval-heapInterval Heap
41median-heapMedian Heap
42k-way-merge-heapK-Way Merge Heap
43top-k-heapTop K Heap
44heap-sortHeap Sort
45partial-heap-sortPartial Heap Sort
46heap-selectionHeap Selection
47lazy-deletion-heapLazy Deletion Heap
48stable-priority-queueStable Priority Queue
49priority-queue-with-tie-breakerTie-Breaking Priority Queue
50concurrent-priority-queueConcurrent Priority Queue
51lock-free-priority-queueLock-Free Priority Queue
52external-memory-heapExternal Memory Heap
53tournament-treeTournament Tree
54loser-treeLoser Tree
55heap-invariant-checkHeap Invariant Check