链表

c++实现链表，这个链表主要包括，添加，删除，反向，连接四个功能
#ifndef _LIST_H
#define _LIST_H
#include

template class List;

template
class ListNode{
friend class List;
private:
T data;
ListNode *link;
ListNode(T);
ListNode();
};

template
class List{
public:
List();
void InSert(T);
void Delete(T);
void InVert();
void Connect(List b);
void Show();
private:
T data;
ListNode *first;
};

template
void List::Show(){
for(ListNode *current = first; current; current=current->link){
std::cout<data;
if (current->link)
{
std::cout<<"–>";
}
}
std::cout<<std::endl;
}

template
ListNode::ListNode(T value){
data =value;
link = 0;
}

template
List::List(){
first = 0;
}

template
void List::InSert(T k){
ListNode *newNode = new ListNode(k);
newNode->link = first;
first = newNode;
}

template
void List::Delete(T k){
ListNode *current ;
ListNode *previous ;
for(current = first;
current && current->data != k;
previous = current, current = current->link)
{;}
if (current)
{
if (previous)
previous->link = current->link;
else
first = first ->link;
delete current;
}

}

template
void List::InVert(){
ListNode *p = first, *q = 0;
while§{
ListNode *r = q; q = p;
p = p->link;
q->link = r;
}
first = q;
}

template
void List::Connect(List b){
if(!first){
first = b.first;
return ;
}
ListNode *current;
for(current = first;
current;
current->link){
;
}
current->link = b.first;
}

#endif