A binomial heap H is a set of binomial trees that satisfies the following binomial-heap properties.
1. Each binomial tree in H obeys the min-heap property: the key of a node is greater than or equal to the key of its parent. We say that each such tree is min-heap-ordered. It tells us that the root of a min-heap-ordered tree contains the smallest key in the tree.
2. For any nonnegative integer k, there is at most one binomial tree in H whose root has degree k. It implies that an n-node binomial heap H consists of at most ⌊lg n⌋ + 1 binomial trees.
3.No two trees will be having same degree and they will be arranged in increasing order of degree.
Here all the trees are having different degrees.
continue construction-of-binomial-heap.php
