Queue Class Reference

Represents an explicit queue used to support non-recursive tree operations. More...

#include <Queue.h>

Public Member Functions
	Queue ()
	Constructs an empty queue.
	~Queue ()
	Destroys the Queue.
void	enqueue (Node *n)
	Adds a node to the end of the queue.
Node *	dequeue ()
	Removes and returns the node at the front of the queue.
bool	isEmpty () const
	Checks whether the queue is empty.

Detailed Description

Represents an explicit queue used to support non-recursive tree operations.

The Queue class implements a simple queue structure composed of node pointers. It is used to support non-recursive, level-order traversal operations within a binary search tree.

The Queue does not assume ownership of the tree nodes it stores; it manages only the queue nodes required to support these operations.

Supported operations include:

• enqueue(): Adds a node pointer to the end of the queue.
• dequeue(): Removes and returns a node pointer from the front of the queue.
• isEmpty(): Checks whether the queue is empty.

Definition at line 64 of file Queue.h.

Constructor & Destructor Documentation

Queue()

Queue::Queue ( )

inline

Constructs an empty queue.

Note

Initializes the queue with its front and rear pointers set to nullptr.

Definition at line 70 of file Queue.h.

: front(nullptr), rear(nullptr) {}

~Queue()

Queue::~Queue

(

)

Destroys the Queue.

Destroys the queue by removing all remaining nodes.

Definition at line 21 of file Queue.cpp.

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

Member Function Documentation

dequeue()

Node * Queue::dequeue

(

)

Removes and returns the node at the front of the queue.

Returns

Pointer to the node removed from the queue.

Dequeues the front element and returns the associated tree node pointer.

Definition at line 45 of file Queue.cpp.

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

enqueue()

void Queue::enqueue

(

Node *

n

)

Adds a node to the end of the queue.

Parameters

n	Pointer to the Node added to the rear of the queue.

Appends a node to the queue.

Definition at line 31 of file Queue.cpp.

                           {
    QueueNode* q = new QueueNode(n);
    if (!rear) {
        front = rear = q;
    }
    else {
        rear->next = q;
        rear = q;
    }
}

isEmpty()

bool Queue::isEmpty

(

)

const

Checks whether the queue is empty.

Returns

True if the queue contains no elements.

Determines whether the queue has any elements.

Definition at line 58 of file Queue.cpp.

                          {
    return front == nullptr;
}

---

The documentation for this class was generated from the following files:

• Queue.h
• Queue.cpp