数据结构与法分析lecture3(链表).pptVIP

Linked list implementation 用一组任意的存储单元存储线性表的数据元素(这组单元可以是连续的，也可以是不连续的) Singly linked list: next Doubly linked list: next, prev (previous) Singly linked list implementation Linked list implementation Template class Elem class Llist: public ListElem { Private: LinkElem* head;//pointer to list header LinkElem* tail; //pointer to last element in list LinkElem* fence;//last element on left side int leftcnt; //size of left partition int rightcnt; //size of right partition 未定义的链表类成员函数的实现 implementation for insert append remove and prev template class Elem//insert at front of righ