Comparing Binomial & Binary Heaps: What's the Difference?

[mathmari]

Hey!

I am reading about binomial heaps. They are priority queue data structures similar to the binary heap, right? (Wondering) Which is the difference between these two heaps? (Wondering)
I haven't really understood the operation of the binomial heaps Union. Could you explain it to me? (Wondering)

 

[I like Serena]

Hey!

I am reading about binomial heaps. They are priority queue data structures similar to the binary heap, right? (Wondering) Which is the difference between these two heaps? (Wondering)
I haven't really understood the operation of the binomial heaps Union. Could you explain it to me? (Wondering)

Well... apparently a binomial heap does not have up to 2 child nodes at each node, but an amount depending on how high we are in the tree. In particular that means that we have $\binom n d$ children at depth $d$ instead of $2^d$.
A "merge" of two binomial heaps of order $k-1$ leads trivially to a binomial heap of order $k$ by adding one heap as a left child to the other tree.