C++ 实现双向链表的实例

 //double LinkList implement with C++ template #include using namespace std; /*template class DBListADT { public: virtual void Append(const Type &)=0; virtual void Insert(const Type &)=0; virtual void Remove(const Type &)=0; }; template class DLinkListNode:public DBListADT//此处必须为实现的类型，当然以派生类的模板类型也可以，但是不能是Type { public: void Append(const T &);//这边也需要是当前类的类型,不能为Type void Insert(const T &); void Remove(const T &); };*/ templateclass DLinkList; template class DNode { friend class DLinkList;//指定前需声明 public: DNode(){next=NULL;prior=NULL;} ~DNode(){} private: DNode *next; DNode *prior; Type data; }; template class DLinkList { public: DLinkList() { //   head=new DNode[sizeof(DNode)]; head=new DNode; } ~DLinkList() { if(head->next==NULL) delete head; else { DNode *p=head->next; DNode*s=NULL; while(p) { s=p->next ; delete p; p=s; } } } void DeleteElement(size_t position) { DNode *p=head->next; size_t index=1; for(;indexnext ; if(p==NULL) return ; p->prior ->next =p->next ; p->next ->prior =p->prior ; delete p; } void InsertElement(T data,size_t position); void CreateDLinkList(T a[],int n); void PrintDLinkList(); private: DNode *head; }; template void DLinkList:: InsertElement (T data,size_t position) { DNode *p=head->next; size_t index=1; for(;indexnext; if(p==NULL) return; //DNode *s=new DNode[sizeof(DNode)]; DNode *s=new DNode; s->data=data; s->next=p; s->prior=p->prior; p->prior->next=s; p->prior=s; } template void DLinkList::CreateDLinkList(T a[],int n) { DNode*p=head; DNode*s=NULL; int i=0; for(;i<n;i++) { // s=new DNode[sizeof(DNode)]; s=new DNode; s->data=a[i]; p->next=s; s->prior=p; p=s; } s->next=NULL; } templatevoid DLinkList::PrintDLinkList () { DNode *p=head->next; while(p) { cout<data<next; } } int main() { int a[10]={1,2,3,4,5,6,7,8,9,10}; DLinkListDlist; Dlist.CreateDLinkList(a,10); Dlist.DeleteElement (3); Dlist.InsertElement(3,3); Dlist.PrintDLinkList(); return 0; } //double LinkList implement with C++ Class //************************************************************ /*#include using namespace std; class Node { friend class List; public: //Node(int a):next(NULL),prior(NULL),data(a){} Node(){} private: Node *next; Node *prior; int data; }; class List { public: List() { cout<<"create head DBLinkList"<next==NULL) { delete head; } else { Node *p=head->next; Node *s; delete head; while(p) { s=p->next ; delete p; p=s; } } cout<<"destructor called to clear DBLinkList"<next =NULL; Node *s,*p=head; int i=0; for(;idata =a[i]; p->next =s; s->prior =p; p=s; } s->next =NULL; } void List::PrintDList() { Node *p=head->next ; while(p) { cout<data <next ; } } void List::DeleteElemData(int position) {//可以通过重载delete运算符来达到这个效果，则直接用delete就OK了 Node *p=head->next ; //while(p!=NULL&&p->data !=data) //   p=p->next ; int i=1; for(;inext ; if(p==NULL) return ; p->prior ->next =p->next ; p->next ->prior =p->prior ; delete p; } void List::InsertElement (int data,int position) {//可以重载new运算符来达到这个效果，则直接用new就OK了 Node *p=head->next ; int i=1; for(;inext ; Node *s=new Node[sizeof(Node)]; s->data =data; s->prior<span style="color:transparent">来源gaodai#ma#com搞*代#码网</span> =p->prior ; s->next =p; p->prior ->next =s; p->prior =s; } int main() { List Dlist; int a[10]={1,2,3,4,5,6,7,8,9,10}; Dlist.CreateDoubleLink (a,10); Dlist.DeleteElemData(3); Dlist.InsertElement (3,3); Dlist.PrintDList (); return 0; }*/ //*************************************************************************************