Data structure single necklace mmx

This map sorts out the knowledge content of the data structure single-chain list mmx, including operations, classification, structure, Def, etc. The structural knowledge framework is convenient for learning and understanding!

Edited at 2022-04-29 21:32:31

PlotWizard

Recent works View more works>>

Data structure single necklace mmx

PlotWizard

Recent works View more works>>

Recommended to you
Outline

linked list

operate

insert node

Operation: First find the correct position p, then apply for a new node t and assign a value to the t node information, and finally insert t after p (Illustration below)

After inserting ordinary nodes

t->Next=p->Next; p->Next=t; / Make the successor of p the successor of t, t then becomes the successor of p, /

Before inserting the head node (Insert as head node)

t->Next=head; head=t; / Make head (head node) the successor of t, t then becomes head (head node), /

delete node

Operation: First find a node p before the deleted node, and then delete the node after p (Illustration below)

Delete ordinary nodes

t=p->Next; p->Next=t->Next; free(t); / Give the person to be deleted (the last digit of p) to t, Let the successor of the person to be deleted (the successor of t) become the successor of p, delete t/

Delete head node

t=head; head->Next=head; free(t); /Give head to t, Put the next position of head first, Delete t. /

Traverse

Processing method: Find the data of each node in the linked list one by one and process it

p=head;/The head node is given to p; while(p!=NULL)/When p is not empty, that is, there is still data in the nodes in the table; {p=p->Next;}/loop allows t to search backward;

Creation of linked list

(1) Continuously insert new nodes at the head of the linked list;

(2) Continuously insert new nodes at the end of the linked list. In this case, it is generally necessary to have a temporary node pointer pointing to the last node of the current linked list to facilitate the insertion of new nodes.

Classification

Single necklace watch

Doubly linked list

circular linked list

Structure: Use nesting of structures to define the data type of singly linked list nodes typedef struct Node *PtrToNode; struct Node { ElementType Data; PtrToNode Next; }; PtrToNode p = (PtrToNode)malloc(sizeof(struct Node)); typedef PtrToNode List; /* Define singly linked list type */

Def: An important basic data structure and an important means to implement complex data structures. It does not store data in a linear sequence, but is composed of several "nodes" of the same structure type connected in sequence, that is, each node stores the address (pointer) of the next node.

Linked list is a way to store data. It emphasizes more on a means rather than simply a table.