链表教程（Linked list tutorial）.doc

链表教程（Linked list tutorial） / / dynamic establishment of the list, assuming that each node contains student learning and achievement, when the input number is 0, said the establishment of the list, the node should not be linked to the list, This program also includes a list / print and delete and insert operations #if (0) #includestdio.h The #includestdlib.h / sizeof function with the header file statement The #includemalloc.h / malloc function with the header file statement #define LEN sizeof (struct student) / / macro definition Struct student (*creat_list); / / custom declaration Void output (struct, student, *head); Struct, student, *del_list (struct, student, *head, int, dnum); Struct, student, *insert_list (struct, student, *head); Struct student / / define global structure { Int num; Float score; Struct student *next; }; Int n; / / global n Int main (void) { Struct student *stu; / / define a pointer to the structure student, the pointer function is used to receive the return address to create lists Struct student *pdel; / / define a pointer to the structure student, the pointer function to receive operation after the return address delete list Struct student *pinsert; / / define a pointer to the structure student, the pointer function to receive the return address insert node after operation Int dnum; / / dnum is used to define a variable input need to delete the node num Stu = (creat_list); / / call function, function is to create a linked list, and the function also returns to create the first address list, with the stu pointer variable to receive Output (stu); / / call function, function is to print out the data domain list each node to create the elements of the argument of the function for the structure of the first address Printf (please input to delete node dnum:); / / input need to delete the node number Scanf (%d, dnum); Pdel = del_list (stu, dnum); / / call function, this function is the function of a node to delete the list, the argument of this fun