The main distinguishable characterstic of a binomial heap from a binary heap is that

• A. it allows union operations very efficiently
• B. it does not allow union operations that could easily be implemented in binary heap
• C. the heap structure is not similar to complete binary tree
• D. the location of child node is not fixed i.e child nodes could be at level (h-2) or (h-3), where h is height of heap and h>4