数据结构学习（C++）——双向链表[4]

       }

       void insert(const type &value)

       {

              node<type> newdata(value, (node<type>*)pget());

              list< node<type> >::insert(newdata);

              if (pgetnext()->link != null)

pgetnext()->link->data.link = (node<type>*)pgetnext();

       }

       bool remove()

       {

              if (list< node<type> >::remove())

              {

                     pget()->data.link = (node<type>*)pgetprior();

                     return ture;

              }

              return false;

       }