notes has very special shape called binomial tree binomial trees are general trees the maximum degree of node is not fixed the remarkable characteristic of binomial queues is that the merge operation is similar in structure to binary additioni the collection of binomial trees that make up the binomial queue is like the set of bits that make up the binary representation of non-negative integer furthermorethe merging of two binomial queues is done by adding the binomial trees that make up that queue in the same way that the bits are combined when adding two binary numbers binomial trees binomial tree is general tree with very special shapedefinition (binomial treethe binomial tree of order > with root is the tree bk defined as follows if bk {ri the binomial tree of order zero consists of single noder if bk {rb bk- the binomial tree of order > comprises the root rand binomial subtreesb bk- figure shows the first five binomial treesb it follows directly from the root of bkthe binomial tree of order khas degree since may arbitrarily largeso too can the degree of the root furthermorethe root of binomial tree has the largest fanout of any of the nodes in that tree figure binomial trees lovely professional university