Question

Assume you wish to take a queue of integers and replace each item with its square using only the normal queue operations of: 6. size) returns the size of the queue removel)- removes an integer from the front of the queue and returns it. add adds an item to the queue. As an example, if I have a queue containing 10, -5, 20. After this operation the queue would contain 100, 25, 400. Give a method to do this operation given an integer queue (Type: IntQueue) void squareQueue IntQueue a) f

Answer 1

void squareQueue(IntQueue q) {
    IntQueue temp = new IntQueue();
    while(q.size() > 0) {
        temp.add(2 * q.remove());
    }
    while(temp.size() > 0) {
        q.add(temp.remove());
    }
}