尾插法创建单链表

000007969老害怕
0 ℃
2020-09-25

整理文档很辛苦，赏杯茶钱您下走！

还剩 ... 页未读，继续阅读 >>

免费阅读已结束，点击下载阅读编辑剩下 ... 页

阅读已结束，您可以下载文档离线阅读编辑

资源描述

StatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）StatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1^LStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1^LlastStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1^Llasti=0StatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1^Llasti=0pStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1^Llasti=0zhaopStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=0zhaopStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=0zhaopStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=0zhaop^StatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=1zhaop^StatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=1zhao^pStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=1zhao^pqianStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=1zhaopqianStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=1zhaopqianStatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=1zhaopqian^StatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//last为指向尾结点的指针for(i=0;in;++i){p=(LinkList)malloc(sizeof(LNode);scanf(&p-data);last-next=p;last=p;p-next=NULL;}}//CreateSqList_LCreateSqList_L(L,4)L(zhao,qian,sun,li)顺序输入n个元素创建带头结点的单链表（尾插法）-1Llasti=2zhaopqian^StatusCreateSqList_L(LinkList&L,intn){L=(LinkList)malloc(sizeof(LNode);//建立表头结点L-next=NULL;last=L;//