Exploring Queues and Deques in PHP

Welcome to our exploration of queues and deques. These structures frequently surface in everyday programming, managing everything from system processes to printer queues. In this lesson, our goal is to understand and implement queues and deques in PHP. Let's dive in!

A queue, similar to waiting in line at a store, operates on the "First In, First Out" or FIFO principle. PHP's SplQueue class enables the implementation of queues. This class includes methods such as enqueue() for adding items and dequeue() for removing items.

<?php

// Create a queue and add items
$q = new SplQueue();
$q->enqueue("Apple");
$q->enqueue("Banana");
$q->enqueue("Cherry");

// Remove an item
echo $q->dequeue() . "\n";  // Expects "Apple"

?>

The dequeued item, "Apple", was the first item we inserted, demonstrating the FIFO principle of queues.

Before trying to remove items from our queue, let's ensure it is not empty. This precaution will prevent errors when attempting to dequeue from an empty queue.

<?php

// Create a queue and enqueue items
$q = new SplQueue();
$q->enqueue("Item 1");
$q->enqueue("Item 2");

// Check if the queue is non-empty, then dequeue an item
if (!$q->isEmpty()) {
    echo $q->dequeue() . "\n";  // Expects "Item 1"
}

?>

A deque, or "double-ended queue," allows the addition and removal of items from both ends. PHP provides the SplDoublyLinkedList class for implementing deques. We can add items to both ends of our deque using the push() method for the right end and the unshift() method for the left. Similarly, we can remove elements from the left and right ends using shift() and pop().

<?php

// Create a deque and add items
$d = new SplDoublyLinkedList();
$d->push("Middle");
$d->push("Right end");
$d->unshift("Left end");

// Remove an item
echo $d->pop() . "\n";  // Expects "Right end"

// Remove an item from the left
echo $d->shift() . "\n"; // Expects "Left end"

?>