模板双向链表

//双向链表
#include<iostream>
#include<string>
using namespace std;
template<class T>
struct LinkNode
{
LinkNode(const T& x)
:_data(x)
, _prev(NULL)
, _next(NULL)
{

}
T _data;
LinkNode<T>* _prev;
LinkNode<T>* _next;
};
template<class T>
class List
{
public:
List()
:_head(NULL)
, _tail(NULL)
{
}
void PushBack(const T& x)
{
if (_head == NULL)
{
_head = new LinkNode<T>(x);
_tail = _head;
}
else
{
LinkNode<T>* tmp = new LinkNode<T>(x);
_tail->_next = tmp;
tmp->_prev = _tail;
_tail = _tail->_next;
}

}
void PopBack()
{
if (_head == NULL)
{
return;
}
else if (_head == _tail)
{
delete _head;
_head = _tail = NULL;
}
else
{
LinkNode<T> *del = _tail;
_tail->_prev->_next = NULL;
_tail = _tail->_prev;
delete del;
}
}
void PushFront(const T& x)
{
if (_head == NULL)
{
_head = new LinkNode<T>(x);
_tail = _head;
}
else
{
LinkNode<T>* tmp = new LinkNode<T>(x);
tmp->_next = _head;
_head->_prev = tmp;
_head = tmp;
}
}
void PopFront()
{
if (_head == NULL)
{
return;
}
else if (_head == _tail)
{
delete _head;
_head = _tail = NULL;
}
else
{
LinkNode<T> *del = _head;
_head->_next->_prev=NULL;
_head = _head->_next;
delete del;
}
}
~List()
{
while (_head)
{
Destory();
}
}
void Print()
{
LinkNode<T>* cur = _head;
while (cur)
{
cout << (cur->_data) << "->";
cur = cur->_next;
}
cout << "NULL" << endl;
}
protected:
void Destory()
{
if (_head == NULL)
{
return;
}
else if (_head == _tail)
{
delete _head;
_head = _tail = NULL;
}
else
{
LinkNode<T>* del = _head;
_head = _head->_next;
_head->_prev =NULL;
delete del;
}
}
protected:
LinkNode<T>* _head;
LinkNode<T>* _tail;
};
void Test1()
{
List<int> k;
k.PushBack(1);
k.PushBack(1);
k.PushBack(1);
k.PushBack(1);
k.PushBack(1);
k.Print();
k.PopBack();
k.PopBack();
k.PopBack();
k.PopBack();
k.PopBack();
k.PopBack();
k.PopBack();

}
void Test2()
{
List<string> l1;
l1.PushFront("abc");
l1.PushFront("eerf");
l1.Print();
l1.PopFront();
l1.PopFront();
l1.PopFront();
l1.PopFront();
}
int main()
{
Test2();
system("pause");
return 0;
}