單鏈表的相關(guān)操作(數(shù)據(jù)結(jié)構(gòu))

#include #include using namespace std;typedef struct Lnodeint data;struct Lnode *next; LNode;int Get_i(LNode *L)couta;while(inext!=NULL)i+;k=k-next; cout第a個元素是dataendl; int Get_value(LNode *L)coutx;while(k-next-data!=x&k-next!=NULL)count+;k=k-next; cout所查找的元素x是第count個endl; void Insert(LNode *L)couti;cout k; while(jnext;j+;q=(LNode*)malloc(sizeof(LNode);q-data=k;q-next=p-next;p-next=q;cout現(xiàn)在的鏈表中數(shù)據(jù)是next!=NULL)coutnext-datanext; void Delete_i(LNode *L)couti;LNode *p=L,*q,*r;r=L;while(jnext; q-next=p-next;free(p);cout現(xiàn)在的鏈表中數(shù)據(jù)是next!=NULL)coutnext-datanext; coutendl; void Delete_value(LNode *L)coutx;LNode *p=L,*q,*r=L;while(p-next-data!=x)q=p;p=p-next; q=p;p=p-next; q-next=p-next;free(p);cout現(xiàn)在的鏈表中數(shù)據(jù)是next!=NULL)coutnext-datanext; coutnext=NULL; q=head; cout請輸入數(shù)據(jù)建立另一個鏈表并同樣以輸入數(shù)字0為結(jié)束標(biāo)志：x; if(x=0) break; else p=(LNode*)malloc(sizeof(LNode); p-data=x; p-next=q-next; /采用尾插法，正序輸出鏈表中數(shù)據(jù) q-next=p; q=p; cout第二個鏈表存數(shù)為：next!=NULL) coutnext-datanext; coutnext!=NULL) a=a-next; a-next=head-next; free(head); cout現(xiàn)在的鏈表中數(shù)據(jù)是next!=NULL) coutnext-datanext; coutnext=NULL; q=head; cout請輸入數(shù)據(jù)建鏈表并以輸入數(shù)字0為結(jié)束標(biāo)志：x; if(x=0) break; else p=(LNode*)malloc(sizeof(LNode); p-data=x; p-next=q-next; /采用尾插法，正序輸出鏈表中數(shù)據(jù) q-next=p; q=p; cout鏈表存數(shù)為：next!=NULL) coutnext-datanext; coutendl; cout*endl; cout0:退出系統(tǒng)endl; cout1：按位置查找元素endl; /Get_i(head); cout2：按值查找元素endl; /Get_value(head); cout3: 執(zhí)行插入操作endl; /Insert(head); cout4: 按位置刪除元素endl; /Delete_i(head); cout5: 按值刪除數(shù)據(jù)endl; /Delete_value(head); cout6: 建立一個新的鏈表并與前一個鏈表連接; /Join(head); coutendl*endl; int t; do coutt; switch(t) case 0: cout*退出系統(tǒng)*endl; break; case 1: Get_i(head); break; case 2: Get_value(head); break; case 3: Insert(head); break; case 4: Delete_i(head); break; case 5: Delete_value(head); break; case 6: Join(head); br