Discrete storage [list]
definition:
N nodes connected to discrete distribution at each node a predecessor node pointer to each other, each node has only a rear drive node. The first node has no predecessor node, tail node no subsequent node
Terminology:
The first node:
First storing valid data nodes (active node)
Tail node:
The last valid node
The first node:
Usually preceded by the first node does not store valid data can be found by the head node the first node can gain access to the list. As the data type of the first node and the following node
Head pointer:
Pointing to the head node pointer variable, containing only four byte pointer variable, small memory footprint.
Tail pointer:
Tail node pointer variable
Determine a list takes several parameters? / Processed through a list function, which parameters need to receive at least the list?
Only one parameter: a head pointer as the pointer can be calculated by the head of the linked list of all other parameters