What is a queue in Java and how do I implement one?

What is a queue in Java and how do I implement one?

A queue in Java is a data structure that follows the First In First Out (FIFO) principle. You can implement one using the Queue interface or the LinkedList class.

Can you show me a simple example of a queue implementation?

Sure! Here's a basic example using LinkedList:

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

public class QueueExample {
    public static void main(String[] args) {
        Queue<Integer> queue = new LinkedList<>();
        queue.add(1);
        queue.add(2);
        queue.add(3);

        System.out.println(queue.poll()); // Outputs 1
        System.out.println(queue.peek()); // Outputs 2
    }
}

What are the main methods of the Queue interface?

The main methods of the Queue interface include add(), remove(), peek(), poll(), and offer(). Each serves different purposes for managing the queue.

Are there any other types of queues in Java?

Yes, Java also provides specialized queues like PriorityQueue, which orders elements based on their natural ordering or a comparator, and BlockingQueue, which is used in concurrent programming.