c++带表头结点的线性链表的实现.doc

#includeusing namespace std;struct Node int data; Node * next; Node()next=NULL;class linklistpublic: Node *head; linklist()head=new Node; linklist(); Node *GetElemPtr(int position); int Length(); bool linklist:Empty(); void Clear(); void traverse(); void getelme(int position,int &e); void setelme(int position,int e); void Insert(int position,int e); void Delete(int position,int &e);linklist:linklist()Clear(); delete head;bool linklist:Empty()return head-next=NULL;Node * linklist:GetElemPtr(int position) Node * tmpPtr=head; int curposition = 0; while(tmpPtr!=NULL & curpositionnext; curposition+; if(tmpPtr!=NULL & curposition=position) return tmpPtr; else return NULL; int linklist:Length() int count=0; Node *tmpPtr; for(tmpPtr=head-next;tmpPtr!=NULL;tmpPtr=tmpPtr-next) count+; return count;void linklist:Clear()int e; while(Length()0) Delete(1,e);void linklist:traverse()for(Node *tmpPtr=head-next; tmpPtr!=NULL;tmpPtr=tmpPtr-next) coutdata ;coutdata;void linklist:setelme(int position,int e)Node *tempPtr=GetElemPtr(position);tempPtr-data=e;void linklist:Insert(int position,int e)Node *newPtr, *tmpPtr; tmpPtr=GetElemPtr(position-1); newPtr=new Node; newPtr-data=e; newPtr-next=tmpPtr-next; tmpPtr-next=newPtr; void linklist:Delete(int position,int & e) Node * tmpPtr; tmpPtr=GetElemPtr(position-1); cout删除的元素为:next-datanext; tmpPtr-next=nextPtr-next; e=nextPtr-data; delete nextPtr; int main() int c=0; linklist la,lb; int e; int position; while(c!=5) cout1.生成线性表endl; cout2.显示线性表endl; cout3.在线性表中插入一个数据endl; cout4.在线性表中删除一个数据endl; coutc; switch(c) case 1: coute; while(e!=0) la.Insert(la.Length()+1,e); coute; break; case 2: la.traverse(); break; case 3: coute; coutposition; la.Insert(positio