Enqueue and dequeue

enqueue to the back, dequeue from the front.

Dequeue operation

dequeue() removes and returns the front element of the queue. This is the first element that was added.

Dequeuing an empty queue is an error. Therefore, check emptiness first. An empty queue may return None or raise an error.

The queue's front is the first element added, the back is the last. Enqueue goes to back, dequeue comes from front.

Think of it like a waiting line: the first to arrive is served first. This is fair queue logic.

Write queue_dequeue(queue). Remove and return the front element. Print 5 with print(queue_dequeue([5, 10, 15])).

Show example solution

def queue_dequeue(queue):
    # Dequeue
    return queue.pop(0)
print(queue_dequeue([5, 10, 15]))

Dequeue

Removing from a queue is done with ____.

Show answer

Removing from a queue is done with dequeue.