Create a Queue.cnn$.$ Queue.cpp contains the member function implementations for Queue.h$.$

Queue.h:

class Queue $\{$

public:

Queue$()$; $//$ ctor inits a new empty Queue

~Queue$()$; $//$ dtor erases any remaining QueueItems

void addItem$($char$*$ pData$)$;

void removeItem$()$;

void print$()$;

void erase$()$;

private:

QueueItem$*\_$pHead; $//$ always points to first QueueItem in the list

QueueItem$*\_$pTail; $//$ always points to last QueueItem in the list

int $\_$itemCounter; $//$ always increasing for a unique id to assign to each new QueueItem

$\}$; $//$ end definitionclass Queue

The Queue class member functions should not have access to the private members of QueueItem objects. They call the public member functions of QueueItem.

As an example, the outline of the Queue::addItem$()$ member function is shown below. It must add a new QueueItem at the tail of the Queue, and update the $\_$pTail pointer to point to it$.$ The first item placed in the Queue becomes both the head and the tail of the list.:

The removeItem$()$ method removes the head QueueItem from the queue, and should release the memory using the C$++$ delete operator. It updates $\_$pHead to point at the following item $($if any$)$ as the new head. If the list becomes empty, both $\_$pHead and $\_$pTail must be set to null $(0).$ It does not change the value of $\_$itemCounter $($which is always incremented when a new item is added$).$ If called on an empty Queue, it does nothing.

The erase$()$ method removes all the items in the queue and should release the memory. To implement, you could loop calling removeItem$()$ until the queue is empty.

The Queue destructor should ensure that all items are removed from the queue. The easiest way is to call the erase$()$ method from the destructor.