Binomial-Queues

Assume, that k = x for a element k with the key x.

Assume, the search for a element k is in O(1) possible.

Make a algorithm(also possible in words or pseudocode) wich can replace the key x from any element k by y < x, with the runtime O(log n). Also explain why the runtime is respected.

Note:

We got operations that are not allowed to use :

- delete(D, k) deletes element k from D

- relocate(D, k, y)

changes the key x from Element k to y

- decrease(D, k, y)

decreases the key x from Element k to y

D(is the tree)