Binomial Heap ·
Mergeable Priority Queue
un
seel
.com · Forest of B
k
trees · union in O(log n) · Vuillemin 1978
n =
0
binary
—
State
—
Heap A (input)
Heap B (input)
Linking (carry)
Merged forest
▶ Play
←
→
Unmute
Reset
Un
seel
.com · Binomial Heap