title: What is the difference between binary heaps and binomial heaps?
body: <p>I need to know the main difference between binary and binomial heaps regardless of the their structure difference that binary heaps can have only two child (tree representation) and binomial heaps can have any number of children.</p>
  
  <p>I am actually just wondering that what so special in organizing the binomial tree structure in such a way that the first child have on one node second have two third have four and so on?</p>
  
  <p>What if, if we use some normal tree for heaps without restriction of two child and then apply the union procedure and just make one heap the left child of  the other heaps?</p>