数据结构-链表逆置（c++模板类实现）

链表结点类模板定义：

 template <class T>
 class SingleList;
 template <class T>
 class Node
 {
 private:
     T element;
     Node<T> *link;
     friend class SingleList<T>;
 };

链表类末班定义：

 template <class T>
 class SingleList
 {
 public:
     SingleList()
     {
         first = NULL;
         n = ;
     }
     ~SingleList();
     void Upstream();
 private:
     Node<T>* first;
 };

链表逆置成员函数：

 template<class T>
 void SingleList<T>::Upstream()
 {
     Node<T> *p = first;
     Node<T> *curr = p->link;
     Node<T> *tmp = NULL;

     p->link = NULL;
     while (curr)
     {
         tmp = curr->link;
         curr->link = p;
         p = curr;
         curr = tmp;

     }

     first->link = NULL;
     first = p;
 }