C++使用模板实现单链表（类外实现）

#include 
using namespace std;
 
template
class CLink
{
public:
 class Node;
 CLink();//无参的构造函数
 void InsertHead(T data);//头插
 void InsertTail(T data);//尾插
 void Show();//打印
 ~CLink();//析构
 Node* Find(T val);//查找
 
private:
 class Node
 {
 public:
 Node(T data = 0);
 ~Node(){}
 public:
 T mdata;
 Node* pnext;
 };
 Node* phead;
};
 
//类外实现无参的构造
template
CLink::CLink()
{
 phead = new Node();
} 
 
//类外实现头插
template
void CLink::InsertHead(T data)
{
 Node* pNewNode = new Node(data);
 pNewNode->pnext = phead->pnext;
 phead->pnext = pNewNode;
}
 
 
//类外实现尾插
template
void CLink::InsertTail(T data)
{
 Node* pNewNode = new Node(data);
 Node* pCur = phead;
 while(pCur->pnext != NULL)
 {
 pCur = pCur->pnext;
 }
 pCur->pnext = pNewNode;
}
 
 
//类外实现打印函数
template
void CLink::Show()
{
 Node* pCur = phead->pnext;
 while (pCur != NULL)
 {
 cout <mdata <<" ";
 pCur = pCur->pnext;
 }
 cout <
CLink::~CLink()
{
 Node* pCur = phead;
 Node* pNext = phead;
 while (pCur != NULL)
 {
 pNext = pCur->pnext;
 delete pCur;
 pCur = pNext;
 }
 phead = NULL;
}
 
//类外实现结点的构造
template
CLink::Node::Node(T data)
{
 mdata = data;
 pnext = NULL;
}
 
//类外实现查找函数
template
typename CLink::Node* CLink::Find(T val)
{
 Node* pCur = phead->pnext;
 while (pCur != NULL)
 {
 if (pCur->mdata == val)
 {
 return pCur;
 }
 pCur = pCur->pnext;
 }
 return pCur;
}
 
int main()
{
 CLink link1;
 CLink link2;
 
 for(int i = 0;i <10;i++)
 {
 link1.InsertHead(i + 1);
 link2.InsertTail(i * 2);
 }
 cout <<"link1:";
 link1.Show();
 
 cout <<"link2:";
 link2.Show();
 
 link1.Find(10);
 
 return 0;
}