Description: The experimental use of forward runs to create a single list method, using a single linked list of functions to dynamically open up space to store data, and delete data free space. First established with a single header node list, and enter data. Then the output of all nodes in a single list of data field values. Then enter the x, y data field in the first node is inserted after x node y, if no node x, then insert the end of the table node y. Finally, the input k, delete all the single linked list node k, and output is the number of nodes removed.
To Search:
File list (Check if you may need any files):
单链表操作.c
Download