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

       bool find(const type &value)//移动current到数据等于value的节点

       {

              if (isempty()) return false;

              for (current = first->link, prior = first; current != null && current->data != value;

                     current = current->link)

                            prior = current;

              if (current != null) return ture;

              else return false;

       }

       bool remove()//删除当前节点，current指向下一个节点，如果current在表尾，执行后current = null

       {

              if (current != null && prior != null)

              {

                     node<type> *p = current;