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

                     prior->link = p->link;

                     current = p->link;

                     delete p;

                     return ture;

              }

              else return false;

       }

       bool removeafter()//删除当前节点的下一个节点，不改变current

       {

              if (current->link != null && current != null)

              {

                     node<type> *p = current->link;

                     current->link = p->link;

                     delete p;

                     return ture;                 

              }