Insert 40, 25, 60, 15, 50 into an empty binomial heap. A binomial heap holds at most one tree of each degree: B0 is a single node, B1 two nodes, B2 four, and so on, so the tree sizes present spell n in binary. Inserting a key adds a B0 and then behaves exactly like adding 1 to a binary number: two trees of the same degree link into one of the next degree, and the carry can run on.
Inserting 5 keys into a binomial heap.
Insert 40 as a new B0, key 1 of 5. The forest holds none: no B0 yet, so the new tree simply joins the root list.
Insert 40: 0 links.
1 keys held as B0: 1 in binary is 1, one bit per tree present. The minimum is among the 1 root.
1 trees: B0.
Insert 25 as a new B0, key 2 of 5. The forest holds B0, so the new B0 meets another B0: they link into a B1, and that links on for as long as the next degree is occupied, 1 1 link in all, like 1 carries in binary addition.
Insert 25: 1 links.
Two trees of degree 0: 25 and 40. The smaller key stays on top and the other tree hangs under it as its newest child, giving a B1 of 2 nodes.
Link 40 under 25.
2 keys held as B1: 2 in binary is 10, one bit per tree present. The minimum is among the 1 root.
1 trees: B1.
Insert 60 as a new B0, key 3 of 5. The forest holds B1: no B0 yet, so the new tree simply joins the root list.
Insert 60: 0 links.
3 keys held as B0, B1: 3 in binary is 11, one bit per tree present. The minimum is among the 2 roots.
2 trees: B0, B1.
Insert 15 as a new B0, key 4 of 5. The forest holds B0, B1, so the new B0 meets another B0: they link into a B1, and that links on for as long as the next degree is occupied, 2 2 links in all, like 2 carries in binary addition.
Insert 15: 2 links.
Two trees of degree 0: 15 and 60. The smaller key stays on top and the other tree hangs under it as its newest child, giving a B1 of 2 nodes.
Link 60 under 15.
Two trees of degree 1: 15 and 25. The smaller key stays on top and the other tree hangs under it as its newest child, giving a B2 of 4 nodes.
Link 25 under 15.
4 keys held as B2: 4 in binary is 100, one bit per tree present. The minimum is among the 1 root.
1 trees: B2.
Insert 50 as a new B0, key 5 of 5. The forest holds B2: no B0 yet, so the new tree simply joins the root list.
Insert 50: 0 links.
5 keys held as B0, B2: 5 in binary is 101, one bit per tree present. The minimum is among the 2 roots.
2 trees: B0, B2.
5 keys in 2 trees, B0, B2, after 3 links. A binomial heap of n keys has at most log2(n) + 1 trees, so every operation, insert, merge, extract-min, is O(log n), and merging two whole heaps is just the same binary addition over both root lists at once.
2 trees after 3 links.