Dequeue Operation

Queue Dequeue Operation

The Dequeue operation removes the first element from the front of the queue.

Key Rules

1. Underflow Check: Before removing an element, verify if the queue contains any elements. If front === -1 or front > rear, the queue is empty. This is a Queue Underflow condition, and the dequeue is rejected.
2. Access Value: Retrieve the value at the current front index (value = queue[front]).
3. Increment Front: Shift the front pointer forward by 1 index (front++) to logically remove the element.
4. Pointer Reset: If the queue is now empty (i.e. the front pointer passes the rear pointer, front > rear), reset both pointers back to -1 to restart the queue from the beginning.