1. add(int data)

Purpose: Add an element at the end of the queue.

Behavior:

If the queue is full (isOverflow() returns true), it prints a message and does not add the element.

Otherwise, increments rear and stores the new element in the array.

Time Complexity: O(1)

2. remove()

Purpose: Remove the element from the front of the queue.

Behavior:

If the queue is empty (isEmpty() returns true), it prints a message and returns -1.

Otherwise, it removes the front element, shifts all remaining elements one step forward, and decrements rear.

Time Complexity: O(n) — due to shifting elements.

3. peek()

Purpose: Get the element at the front of the queue without removing it.

Behavior:

If the queue is empty, prints a message and returns -1.

Otherwise, returns the first element of the array.

Time Complexity: O(1)

4. isEmpty()

Purpose: Check whether the queue has any elements.

Behavior:

Returns true if rear == -1 (no elements in the queue), otherwise false.

Use Case: Helps prevent errors when removing or peeking from an empty queue.

5. isOverflow()

Purpose: Check whether the queue is full.

Behavior:

Returns true if rear == size - 1 (no more space to add elements), otherwise false.

Use Case: Helps prevent adding elements beyond the array size.

#5959 #queue #165