Queues

Queues

1. Collection of objects that are inserted and removed according to the FIFO principle

   • FIFO: first-in, first-out

2. Update methods

   • enqueue()
     • Adds element e to the back of the queue
   • dequeue()
     • Removes and returns the first element

3. Accessor methods

   • first()
     • Return the first element of the queue, without removing it
   • size()
     • Returns the number of elements in the queue
   • isEmpty()
     • Returns a boolean indicating whether the queue is empty