List storage area without having continuous, where memory space where to put it
Constitute the list
Is constituted by a plurality of nodes, each node consists of two parts, one is used to store data in the data field , used to store a pointer pointing to the next node in the target domain .
The beginning and end of the list:
1. The beginning of the list is the head pointer or the head node
Head pointer : see the name is intended to know, which of pointers, pointing to a linked list stored in the current data stored in the first node the first node i.e., no data head pointer field, so it is not a node
The first node: with respect to the head pointer, it has an additional data field, but it is not the first node in the list are not used to store data, and can be used to store additional information on the length of the list and the like.
2. The list of end
Only the end of the list of data fields, the art does not store the pointer value is null
Personal understanding: chain as like a chain, but a ring set with a ring, only a one touch down