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

              {

                     p = p->link;

                     count++;

              }

              return count;

       }

       type *get()//返回当前节点的数据域的地址

       {

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

              else return null;

       }

       bool put(type const &value)//改变当前节点的data，使其为value

       {

              if (current != null)

              {

                     current->data = value;

                     return ture;