Write the output produced by the following function when pas…
Write the output produced by the following function when passed each of the following queues: Assume that a stack prints in {bottom, …, top} order, a queue displays in {front, …, back} order and maps print as {key1=value1, … keyN=valueN}. void mystery(queue& q) { stack s; map m; int oldSize = q.size(); for (int i = 0; i < oldSize; i++) { if (i % 2 == 0) { q.push(q.front()); q.pop(); } else { s.push(q.front()); q.pop(); } m[q.front()] = i; } for (int i = 0; i < oldSize; i++) { if (i % 2 == 0) { q.push(q.front()); q.push(m[q.front()]); q.pop(); } else { q.push(s.top()); s.pop(); } } cout
Read Details