Get the most out of your questions with IDNLearn.com's extensive resources. Explore a wide array of topics and find reliable answers from our experienced community members.
Answer:
Explanation:
The following code is written in Java it goes through the queue that was passed as an argument, loops through it and removes all the odd numbers, leaving only the even numbers in the queue. It does not add any more data structures and finally returns the modified queue when its done.
public static Queue<Integer> evens(Queue<Integer> queue) {
int size = queue.size();
for(int x = 1; x < size+1; x++) {
if ((queue.peek() % 2) == 0) {
queue.add(queue.peek());
queue.remove();
} else queue.remove();
}
return queue;
}