C++:修改数据结构程序

//////////////////////////////

#include<iostream.h>
#include"LinQueue.h"
void main()
{
char ch[10];
for(int i=0;i<10;i++)
cin>>ch[i];
LinQueue MyQueue1,MyQueue2;
MyQueue1.Initialize();
MyQueue2.Initialize();
LinQueue<char> MyQueue1;
LinQueue<char> MyQueue2;
for(int i=0;i<10;i++)
{
MyQueue1(ch[i]);
MyQueue1.JISHUQI();

}
for(int j=10;j>0;j++)
{
//n>>ch;
MyQueue2(ch[i]);
MyQueue2.JISHUQI();
}
for(int k=0;k<10;k++)
{
if(MyQueue1.del()!=MyQueue2.del())cout<<"不是回文数！"<<endl;
return;
}
cout<<"是回文数！"<<endl;
}

/////////////////////////////////////////////////////

头文件：

template<class T>
class LinNode
{
T item;
T *next;
public:
LinNode();
LinNode(const T& item1,const T*pt

#include<iostream.h>
#include<string.h>
#include<process.h>

template<class T>
class LinNode
{
T item;
LinNode<T> *next;
public:
LinNode(const T& item1){item=item1; next=NULL;};
LinNode<T> *get_next(){return next;}
void set_next(LinNode<T> *item1){next = item1;};
T get_item(){return item;}
};

template<class T>
class LinQueue
{
LinNode<T> *front;
LinNode<T> *rear;
int count;
public:
LinQueue(){front = rear = NULL;};
virtual ~LinQueue();
void append(const T&item);
T del();
};

template<class T>
LinQueue<T>::~LinQueue(){
LinNode<T> *temp;
while(front)
{
temp = front;
front = temp->get_next();
delete temp;
}
}

template<class T>
void LinQueue<T>::append(const T&item)