root list of thenthe order of ' children is reversed and they are all added to the root list of hcfinallyunion_binomial-heap (hhc/is called to unite the two heaps and is returned the algorithm min-extract_binomial-heap(runs in (log ntimewhere is the number of nodes in example extract the node with the minimum value from the given binomial heap head [ solution head [ (step head [ head [ ' (step head [ (step figure binomial heap binomial-heap_decrease_val(hxkstep if val[xkthen print errorstep set val[xk step set ptr and par parent[ptrstep repeat while par null and val[ptrval[parstep swap val[ptr]val[parstep set ptr par and par parent [ptr[end of loopstep end figure algorithm to decrease the value of node in binomial heap decreasing the value of node the algorithm to decrease the value of node in binomial heap is given in fig in the algorithmthe value of the node is overwritten with new value kwhich is less than the current value of the node in the algorithmwe first ensure that the new value is not greater than the current value and then assign the new value to the node