Show that using a stack instead of a queue in the previous exercise is bad by giving a sequence that leads to Ω(N) cost per operation. This is the left-to-right single-pass merge.
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.