#include

#include "linkedQueue.h$"$

using namespace std;

void testCopyConstructor$($linkedQueueType otherQueue$)$;

int main$()$

$\{$

linkedQueueType queue$1,$ queue$2$;

int x$,$ y;

x $=4$;

y $=5$;

queue$1.$addQueue$($x$)$;

queue$1.$addQueue$($y$)$;

x $=$ queue$1.$front$()$;

queue$1.$deleteQueue$()$;

queue$1.$addQueue$($x $+5)$;

queue$1.$addQueue$(16)$;

queue$1.$addQueue$($x$)$;

queue$1.$addQueue$($y $-3)$;

queue$1.$addQueue$(65)$;

queue$1.$addQueue$(102)$;

queue$1.$addQueue$(44)$;

queue$2=$ queue$1$;

cout $$ "The number of elements in QUEUE$1$: $"$

$$ queue$1.$queueCount$()$ endl;

queue$1.$deleteQueue$()$;

cout

After the deleteQueue operation, the number of elements

in QUEUE$1$ : $"$

$$ queue$1.$queueCount$()$ endl;

cout

QUEUE$1$ : $"$;

while $(!$queue$1.$isEmptyQueue$())$

$\{$

cout $$ queue$1.$front;

queue$1.$deleteQueue$()$;

$\}$

cout $$ endl;

cout

QUEUE$2$ : $"$;

while $(!$queue$2.$isEmptyQueue$())$

$\{$

cout $$ queue$2.$front;

queue$2.$deleteQueue$()$;

$\}$

cout $$ endl;

return $0$;

$\}$