Create QueueItem.cpp by implementing QueueItem.h

QueueItem.h:

class QueueItem

$\{$

public:

QueueItem$($char$*$ pData, int id$)$; $//$ ctor

void setNext$($QueueItem$*$ pItem$)$;

QueueItem$*$ getNext$()$ const;

int getId$()$ const;

const char$*$ getData$()$ const;

private:

char $\_$data$[30]$;

const int $\_$itemId; $//$ unique id for item in queue

QueueItem$*\_$pNext; $//$ next item in queue

$\}$; $//$ end definition class QueueItem

Create Queue.cpp by implementing Queue.h

Queue.h:

#include

#include "QueueItem.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