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

                     prior->link = p;

                     prior = p;

                     return ture;

              }

              else return false;

       }     

       bool locate(int i)//移动current到第i个节点

       {

              if (i <= -1) return false;

              current = first->link;

              for (int j = 0; current != null && j < i; j++, current = current->link)

                     prior = current;

              if (current != null) return ture;

              else return false;

       }