Binomial Heap — Interactive Visualization

A forest of binomial trees, one per set bit in n. Insert / Extract-Min / Meld with carry-propagation animations.

Insert value

Operations

Step Controls

Speed 600ms

default min-root linking carrying extracted

Size: 0 Trees: 0 Min: — Max rank: — Operations: 0

READY Empty heap. Insert a value or meld with a random heap to begin. Each set bit in n corresponds to one binomial tree.

n (binary):

n_binary = 0 → #trees = 0