Introduction - If you have any usage issues, please Google them yourself
Singly linked list with additional head node, try to write the following function.
(1) orientation function Locate is: in a single linked list to find the i-th node. If found, the function returns the i-node address if no, then the function returns NULL.
(2) the maximum function max: traversing through a trip to determine the value of the largest node in a singly linked list.
(3) The number of statistical functions: statistical singly linked list with all the elements of a given value of x.
(4) the establishment of the create function: one-dimensional array a [n] to establish a single linked list, singly linked list in the order of the elements a [n] is the order of the elements of the same requirements of the program s time complexity is O (n).