70 Queue() : front(nullptr), rear(nullptr) {}
Declaration of the Node class.
Represents a node within a binary search tree.
~Queue()
Destroys the Queue.
Node * dequeue()
Removes and returns the node at the front of the queue.
void enqueue(Node *n)
Adds a node to the end of the queue.
bool isEmpty() const
Checks whether the queue is empty.
Queue()
Constructs an empty queue.
Internal node type used by the Queue class.
QueueNode(Node *data)
Constructs a QueueNode with the specified node pointer.