数据结构学习（C++）——单链表（定义与实现）[3]

//基本上无参数的成员函数操作的都是当前节点，即current指的节点

//认为表中“第1个节点”是第0个节点，请注意，即表长为1时，最后一个节点是第0个节点

public:

       list() { first = current = last = new node<type>; prior = null; }

       ~list() { makeempty(); delete first; }

       void makeempty()       //置空表

       {            

              node<type> *q;

              while (first->link != null)

              {

                     q = first->link;

                     first->link = q->link;

                     delete q;