For the binomial queue
a. Modify the merge routine to terminate merging if there are no trees left in H2 and the carry tree is nullptr.
b. Modify the merge so that the smaller tree is always merged into the larger.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.