1.5 Heaps and Priority Queues

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

1.5 Heaps and priority queues, 55

index slug name
1 binary-heap Binary Heap
2 min-heap Min Heap
3 max-heap Max Heap
4 heap-insert Heap Insert
5 heap-extract-min Extract Minimum
6 heap-extract-max Extract Maximum
7 heap-peek Heap Peek
8 heap-sift-up Sift Up
9 heap-sift-down Sift Down
10 heapify Heapify
11 bottom-up-heap-construction Bottom-Up Heap Construction
12 top-down-heap-construction Top-Down Heap Construction
13 heap-replace Heap Replace
14 heap-push-pop Heap Push Pop
15 heap-decrease-key Decrease Key
16 heap-increase-key Increase Key
17 heap-delete Heap Delete
18 heap-update-key Update Key
19 d-ary-heap D-ary Heap
20 ternary-heap Ternary Heap
21 quaternary-heap Quaternary Heap
22 binomial-heap Binomial Heap
23 fibonacci-heap Fibonacci Heap
24 pairing-heap Pairing Heap
25 leftist-heap Leftist Heap
26 skew-heap Skew Heap
27 rank-pairing-heap Rank Pairing Heap
28 hollow-heap Hollow Heap
29 soft-heap Soft Heap
30 treap-priority-queue Treap Priority Queue
31 bucket-priority-queue Bucket Priority Queue
32 radix-heap Radix Heap
33 calendar-queue Calendar Queue
34 indexed-priority-queue Indexed Priority Queue
35 addressable-priority-queue Addressable Priority Queue
36 meldable-priority-queue Meldable Priority Queue
37 bounded-priority-queue Bounded Priority Queue
38 double-ended-priority-queue Double-Ended Priority Queue
39 min-max-heap Min-Max Heap
40 interval-heap Interval Heap
41 median-heap Median Heap
42 k-way-merge-heap K-Way Merge Heap
43 top-k-heap Top K Heap
44 heap-sort Heap Sort
45 partial-heap-sort Partial Heap Sort
46 heap-selection Heap Selection
47 lazy-deletion-heap Lazy Deletion Heap
48 stable-priority-queue Stable Priority Queue
49 priority-queue-with-tie-breaker Tie-Breaking Priority Queue
50 concurrent-priority-queue Concurrent Priority Queue
51 lock-free-priority-queue Lock-Free Priority Queue
52 external-memory-heap External Memory Heap
53 tournament-tree Tournament Tree
54 loser-tree Loser Tree
55 heap-invariant-check Heap Invariant Check