l4--discrete storage [linked list]

Defined

• n discrete distribution of nodes;
• Connected to each other by pointers;
• Each node has only one precursor node, and each node has only one subsequent node;
• The first node has no precursor node, and the tail node has no subsequent nodes.

Professional terminology:

• First node: First active node
• Tail node: Last valid node
• Head nodes: The data type of the head node is the same as the first nodes type, the node before the first active node, the head node does not hold valid data [can be convenient for the operation of the linked list]
• Head pointer: Pointer variable pointing to the head node
• Tail pointer: pointer variable pointing to tail node

If you want to work with a linked list through a function, which parameters the function needs to accept:

• Only one parameter is needed: the head pointer
• Because we can infer all the other information from the list by the head pointer.
• Node Construction:

• #include <stdio>struct  node{    int data;   data domain    struct Node * pnext;   pointer field }node *pnode//node equivalent to struct node  pnode equivalent to struct node *int Main (void) {    return0;}

Classification

• Single linked list
• Double tables: Each node has two pointer fields
• Circular link list: All other nodes can be found through any one node
• Non-circular linked list:

Algorithm

• Traverse
• Find
• Empty
• Destroyed
• Request length
• Sort
• Delete a node

l4--discrete storage [linked list]