Queue

Identification

A queue supports FIFO operations. This provides two $O(1)$ operations. Adding an element to the end, and removing the first element. You can only access the first and last element of a queue. There are different types:

• Circular queue’s connect the first and last nodes. One benefit of using this type of queue, is that once the queue becomes full, and there is space at the start of the queue, we can insert new values.