A binomial heap is a forest of binomial trees with unique orders where insert, push and pop are implemented as merging two forests of binomial trees. Insertion is done through merging the heap with a trivial binomial tree with the element to be inserted.

A set of slides is available on Binomial Trees.