A min-heap kept as a list of binomial trees, one for each 1 bit of n. Union is binary addition: two trees of the same size link into one, a carry.
This interactive visualization needs JavaScript.