dequeue
RU: dequeue
To remove and return the element at the front of a queue. In a FIFO queue, dequeue removes the oldest (first-inserted) element. Operation is O(1) with proper implementation (linked list or circular buffer).
RU: dequeue
To remove and return the element at the front of a queue. In a FIFO queue, dequeue removes the oldest (first-inserted) element. Operation is O(1) with proper implementation (linked list or circular buffer).