Binomial Queues

Assume that for a element k with the key x we have k = x, untill the function relocate(D, k, y) is not called.

Let D be a empty Binomial-Queue. Make a Calculation to get the largest amount of elements that are possible to insert, so that D

i) has a type of a binomial tree B1, B3, B5 and B7

ii) has no type of Bi with B1 >= n for any n

Notes:

- Keys are the Elements in the nodes - reloate(D, k, y) deletes a key "k" and changes the key k with y and inserts k back in the tree. - Types from trees:

63 10 Bit1 oa 63 10 Bit1 oa