Description: From left to right and right to left traverse a single linked list is possible in from left to right during traversal connection direction reversal, as shown on the right. Pointer p points in the diagram is currently being accessed node pointer PR point to the left side of the pointer p junction referred junction. At this point, the pointer p nodes referred to the left all nodes link direction are reversed. (1) preparation of an algorithm, from a given position (PR, P) start, the pointer p to the right k nodes. If p is removed from the linked list, then p is set to 0, and Pr remain in the linked list of the right-most node. (2) the preparation of an algorithm, from any given position (PR, P) start, the pointer p to the left k nodes. If p is removed from the linked list, then p is set to 0, and Pr remain in the linked list of the left-most node.
To Search:
File list (Check if you may need any files):
2.1.cpp
2.2.cpp
1.1.cpp
1.2.cpp
Download