Defined: n discrete distribution nodes, connected to each other by pointers, each node has only one predecessor node, each node is only a subsequent node, the first node without predecessor node, the end node without a successor node
Terminology:
The first node: the first valid node
End nodes: the last valid node
The first node : the first node and the first node of the data type of the same type of a node that the first node before the node does not store valid data header node main purpose is to facilitate the operation of the linked list
Head pointer: a pointer to the first variable node
Tail pointer: a pointer to the end of the variable node
If you want to process the list by a function, at least what we need to receive the list of parameters:
Only one parameter: a head pointer
Because we can calculate all other parameters through a linked list head pointer
classification:
algorithm:
The list of advantages and disadvantages: