Definition
In each of the cases, the customer or object at the front of the line was the first one to enter,
while at the end of the line is the last to have entered. Every time a customer finishes paying for their
items (or a person steps off the escalator, or the machine part is removed from the assembly line, etc.)
that object leaves the queue from the front. This represents the queue ?dequeue? function. Every time another
object or customer enters the line to wait, they join the end of the line and represent the ?enqueue? function.
The queue ?size? function would return the length of the line, and the ?empty? function would return true only if
there was nothing in the line.Queue Example Program
import java.io.IOException;
import java.util.LinkedList;
import java.util.Queue;
public class QueueExample {
public static void main(String arg[]) throws IOException {
Queue q = new LinkedList();
// Add in Queue
q.add(23);
q.add(33);
System.out.println(q);
System.out.println("Queue Element :"+q.element());
// Offer In Queue
q.offer(34);
q.offer(98);
q.offer(77);
System.out.println(q);
System.out.println("Queue Element :"+q.element());
q.poll();
System.out.println("Queue Element :"+q.element());
System.out.println("After poll : " + q);
}
}
Sample Output
Output is:
[23, 33]
Queue Element :23
[23, 33, 34, 98, 77]
Queue Element :23
Queue Element :33
After poll : [33, 34, 98, 77]
