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

              }

              else return false;

       }

       type *getnext()//返回当前节点的下一个节点的数据域的地址，不改变current

       {

              if (current->link != null) return &current->link->data;

              else return null;

       }

       type *next()//移动current到下一个节点，返回节点数据域的地址

       {

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

              {

                     prior = current;

                     current = current->link;

                     return &current->data;

              }