动态单链表头文件（dynamic single chain header file）

《动态单链表头文件（dynamic single chain header file）》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、动态单链表头文件（Dynamicsinglechainheaderfile）Dynamicsingleheaderfile.H//List://storageunitsequentiallystoresanarbitrarysetoflineartabledataelements.#defineOVERFLOW-1//-----lineartable,singlelinkedliststoragestructureTypedefstructLNode{ElemTypedata;//datadomaindataStructLNode*next;//po

2、interdomainnext}LNode,*LinkList;//1.initializationemptylistStatusInitList_L(LinkList&L){//constructsanemptyleadsinglenodelistLL=(LNode*malloc)(sizeof(LNode));//createheadnodeIf(L!)exit(OVERFLOW);//memoryallocationfailureL->next=NULL;ReturnOK;}//InitList_Sq//2.establishlinkedlis

3、tLStatuscreateLink(LinkList&L){//tailinterpolationtoestablishaleadsinglenodelistLLinkListP,r;L=r=(LNode*malloc)(sizeof(LNode));//createheadnodeP=(LNode*malloc)(sizeof(LNode));//thefirstelementnodedistributionCout<<"inputdata:(0end):"cin>>p->data;While(p->data){r->next=p;//newno

4、dePchainintotheendofthetableR=p;//RshiftafterthetailpointertableP=(LNode*malloc)(sizeof(LNode));//assignanewnodeCin>>p->data;}R->next=NULL;//thelastnodepointerfieldisemptyReturnOK;}//3.destroylinkedlistStatusDestroyList(LinkList&L){//destroyedthelinearlistL,LnolongerexistsLinkL

5、istP,q;P=L;L=NULL;While(P){q=p->next;free(P);p=q;}ReturnOK;}//4.resetemptylistStatusClearList(LinkList&L){//linearlistLresettoanemptytable,andthereleaseoftheoriginallistofthenodespaceLinkListP,q;P=L->next;L->next=NULL;While(P){q=p->next;free(P);p=q;}ReturnOK;}//5.determineswhet

6、heranemptylistStatusListEmpty(LinkListL)IftheLisempty{//linearlisttable,TRUEisreturned,otherwiseitreturnsFALSEIf(L->next)returnFALSE;ElsereturnTRUE;}//6.forlonglistIntListLength(LinkListL){//returnsthenumberofelementsinalinearchainLLinkListp;inti=0;P=L->next;While(P){i++;p=p->n

7、ext;}Returni;}//7.tableIelementalgorithm2.8StatusGetElem_L(LinkListL,inti,ElemType&e)TheIelements{//fromsinglelinkedlistpointertoLLintheleadnodevalueisassignedtoeandreturntoOK,//ERRORotherwise.LinkListp;intj;P=L->next;j=1;//initialization,Preferstothefirstnode,JcounterWhile(p&&

8、j