实验二-3(国外英文资料).docVIP

实验二-3 Header file linklist3.h / / ElemType was defined as int type Typedef int ElemType; / / type single list node Struct LNode{ ElemType data; / / range LNode* next; / / pointer domain }; / / define a single table Struct Linklist{ LNode* head; Public: / / constructor LinkList () {head=NULL;} / / copy constructor Linklist (LinkList, HL); / / destructor ~LinkList (); / / for the length of a single linked list Int, ListSize (); Check / single linked list is empty Bool, ListEmpty (); Returns the specified number of nodes / value in a single list ElemType GetElem (int POS); / / traverse a single table Void, TraverseList (); / / from a single list to find elements Bool FindList (ElemType item); / / update a single list in a given element Bool UpdateList (const, ElemType, item); / / table insert elements to a single Void InsertList (const, ElemType, item, int, mark); / / delete elements from a single list Bool DeleteList (ElemType, item, int, mark); In order to output a single list / / Void OrderOutputList (int mark); }; Implementing file linklist3.cpp #includeiomanip.h #includestdlib.h #include linklist3.h / / copy constructor Linklist (LinkList, HL) { If (HL.head==NULL) {head=NULL; return;} Head=new LNode; Head-data=HL.head-data; LNode, *p, *q=head; For (p=HL.head-next; p; p=p-next) { Q=q-next=new LNode; Q-data=p-data; } Q-next=NULL; } / / destructor Linklist:: ~LinkList () { LNode, *cp, *np; Cp=head; While (CP, =NULL) { Np=cp-next; Delete cp; Cp=np; } Head=NULL; } / / for the length of a single linked list Int Linklist:: ListSize () { LNode* p=head; Int i=0; While (P, =NULL) { I++; P=p-next; } Return i; } Check / single linked list is empty Bool Linklist:: ListEmpty () { Return (head==NULL); } Returns the specified number of nodes / value in a single list ElemType Linklist:: GetElem (int, POS) { If (pos1) { Cerr POS, is, out, range... endl; Exit (1); } LNode* p=head; Int i=0; While (P, =NULL) { I++; If (i==pos) break; P=p-next; } If (P, =NULL) Return p-data; 别的{ cerr “