线性单链表（Linear single chain table）.docVIP

线性单链表（Linear single chain table） The establishment of a single list of / /, insert, delete, query, and Implementation #include stdio.h #include stdlib.h// contains the malloc function #define LEN sizeof (struct LNode) Typedef struct LNode { Int data; / / data domain Struct LNode *next; / / pointer domain } LNode, *LinkList; //LNode single linked list node type, *LinkList single linked list data type Int, GetElem_L (LinkList, int, int ); //GetElem_L Int, ListInsert_L (LinkList int, int); //ListInset_L Int, ListDelete_L (LinkList int, int ); //ListDelete_L Void CreateList_L (LinkList int); //CreateList_L () Void MergeList_L (LinkList LinkList LinkList ); //MergeList_L () Int LocateElem_SL (LinkList int); //LocateElem_SL Void showList (LinkList); / / LinkList L cannot have, namely no reference Int, main () { LNode, *L1, *L2, *L3, *L4; Int, N, J, i; / / menu Printf (C singlechain ------------------\n); Printf (C you are welcome to use ------------------\n); Printf (this program will be implemented in turn: \n); Printf (1. implementation of single linked list \n); Printf (2. to achieve the merger of two single linked lists \n); Printf (3. implementation of single linked list insertion \n); Printf (4. implementation of single linked list, delete \n by value); Printf (5. to achieve the single linked table delete \n by bit); Printf (6. implementation of single linked table query \n); The establishment of a single list / / Printf (please enter the number of the first element group:); Scanf (%d, n); Printf (please enter the elements:); CreateList_L (L1, n); / / showList (L1); The establishment of a single linked list / / second Printf (please enter the number of second ordered element groups:); Scanf (%d, n); Printf (please enter the elements:); CreateList_L (L2, n); / / showList (L2); MergeList_L (L1, L2, L3); / / two single linked lists Printf (two ordered elements are combined and then changed to:); ShowList (L3); The realization of a single list / / insert Printf (