Queue.cpp

Go to the documentation of this file.

 
#include "Queue.h"
#include <iostream>

Queue::~Queue() {
    // Remove all nodes from front to rear.
    while (!isEmpty()) {
        dequeue();
    }
}

void Queue::enqueue(Node* n) {
    QueueNode* q = new QueueNode(n);
    if (!rear) {
        front = rear = q;
    }
    else {
        rear->next = q;
        rear = q;
    }
}

Node* Queue::dequeue() {
    if (!front) return nullptr;
    QueueNode* temp = front;
    Node* result = temp->data;
    front = front->next;
    if (!front) rear = nullptr;
    delete temp;
    return result;
}

bool Queue::isEmpty() const {
    return front == nullptr;
}