Single Linked list correlation algorithm

[1] Printed single linked list, void Printlist (List list);

Use a pointer to traverse all linked table nodes.

[2] Two ascending lists, printing the corresponding elements in the tarlist, which are specified by seqlist, void printlots (list tarlist, List seqlist);

Use two pointers to traverse two of the list, each time the sequence list of a serial number, according to the serial number, to reach the target list specified node.

[3] Two ascending list intersections, List Intersect (list L1, List L2);

[4] Two ascending lists and sets, List Join (list L1, List L2);

[5] Single linked list in place inverse, void Reverse (list L);

Uses three pointers to represent the predecessor, the current and subsequent nodes, each of the current node's next point to the predecessor node, and then traversing backwards until the end of the list.