How do I implement queue operations in Java?

How do I implement queue operations in Java?

You can implement queue operations in Java using the Queue interface and its implementations like LinkedList or PriorityQueue. Would you like a code example?

Yes, please provide a code example for basic queue operations.

Here's a simple example:

import java.util.LinkedList;
import java.util.Queue;

public class QueueExample {
    public static void main(String[] args) {
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1); // Add element
        queue.offer(2);
        System.out.println(queue.poll()); // Remove and return head
        System.out.println(queue.peek()); // Return head without removing
    }
}

What are the differences between offer(), poll(), and peek()?

offer() adds an element to the queue, poll() removes and returns the head, and peek() returns the head without removing it.