Page "Binomial heap" Paragraph 6

Because of its unique structure, a binomial tree of order k can be constructed from two trees of order k − 1 trivially by attaching one of them as the leftmost child of root of the other one.

This feature is central to the merge operation of a binomial heap, which is its major advantage over other conventional heaps.