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

       cout << *a.next() << endl;

       cout << *a.next() << endl;

       cout << *a.next() << endl;

       a.remove();

       cout << *a.get() << endl;

       cout << *a.prior() << endl;

       cout << *a.prior() << endl;

       cout << *a.prior() << endl;

}