In a circular queue, items at the end of the queue are linked to the front of the queue, and vice versa. Items may then be added or removed from either end of the queue as required by the program. In a linear queue, that is no longer the case; and items may typically only be removed from the front of the queue and added to the end of it.