Queues

Queue

An ordered collection where items are added at one end (rear/tail) and removed from the other end (front/head), following the principle of First In - First Out (FIFO).

enqueue

The operation of adding an element to the rear of the queue.

dequeue

The operation of removing an element from the front of the queue.

Bounded Queue

A queue that is limited to a fixed number of items, with a set capacity that cannot be changed after creation.

Circular Queue

A type of bounded queue where the front and rear indexes slide, allowing the structure to wrap around when it reaches the end.

FIFO

First In, First Out; a principle stating that the first element added to a queue will be the first to be removed.

isEmpty()

A method that checks whether the queue is empty, returning a boolean value.

size()

A method that returns the number of items currently in the queue.

peek()

A method that allows checking the front item of the queue without removing it.

Double-ended Queue (Deque)

A data structure that allows insertion and deletion of elements from both ends.