int main()
{
MyQueue *p = new MyQueue(4);
p->EnQueue(10);
p->EnQueue(2);
p->EnQueue(13);
p->EnQueue(5);
p->QueueTraverse();
cout << "delete element" << endl;
int e = 0;
p->DeQueue(e);
cout << e << endl;
p->DeQueue(e);
cout << e << endl;
cout << "Queue:" << endl;
p->QueueTraverse();
p->ClearQueue();
p->QueueTraverse();
p->EnQueue(1);
p->QueueTraverse();
delete p;
p = NULL;
system("pause");
return 0;
}
void Output(BinTree<char> &B)
{
int num;
MyQueue<char> Q;
B.InOrderInMirror(B.root,Show,Q);
int i=0;
char arr[DEFAULTSIZE];
B.PreOrder(B.root,arr,i);
while (!Q.IsEmpty())
{
num=NumCal(arr,Q.getFront());
for (i=1;i<num;i++) cout<<" ";
cout<<Q.DeQueue()<<endl;
}
}
