C++模板类实现的简单的单链表

//*************************单链表（2个类）**********************************

#include

using namespace std;

template
class LinkList;

template
class Node                             //结点类
{
public:
Node():next(NULL){}
private:
T data;
Node *next;

friend class LinkList;

};

template
class LinkList                        //链表类
{
public:
LinkList()
{
phead = new Node;
}
~LinkList()
{
Node *tmp;

while(phead != NULL)

{
tmp = phead->next;
free(phead);
phead = tmp;
}
}
void InsertHead(const T &value)                 // 头插法
{
Node *p = new Node;
p->data = value;
p->next = phead->next;
phead->next = p;
}
void DeleteHead()                                         //头删法
{
Node *tmp = phead->next;
phead->next = tmp->next;

free(tmp);
}
void Show()                                                     //打印单链表里面的值
{
Node *p= phead->next;
while(p != NULL)
{
cout<data<<"  ";
p = p->next;
}  
}
private:
Node *phead;                                          //头结点
};

int main()
{
LinkList LinkList;
LinkList.InsertHead(1);
LinkList.InsertHead(2);
LinkList.InsertHead(3);
LinkList.Show();

return 0;
}

//***********************************************************
//***************************   嵌套类***********************
#include
using namespace std;

template

class LinkList
{
public:
LinkList()
{
phead = new Node;

}
~LinkList()
{
Node *tmp;
while(phead != NULL)
{
tmp = phead->next;
free(phead);
phead = tmp;
}
}
void InsertHead(const T &value)
{
Node *p = new Node;
p->data = value;
p->next = phead->next;
phead->next = p;
}
void DeleteHead()
{
Node *tmp = phead->next;
phead->next = tmp->next;
free(tmp);
}
void Show()
{
Node *p= phead->next;
while(p != NULL)
{
cout<data<<"  ";
p = p->next;
}

}

private:

class Node

{
public:
Node():next(NULL){}
T data;
Node *next;

};

Node *phead;
};


int main()
{
//LinkList LinkList;
//LinkList.InsertHead(1);
//LinkList.InsertHead(2);
//LinkList.InsertHead(3);
//LinkList.Show();


LinkList tmp;
tmp.InsertHead(1.21);
tmp.InsertHead(2.22);
tmp.InsertHead(3.14592);
tmp.Show();


return 0;
}