The nodes of the linked list in the memory are not necessarily continuously distributed. From the logical structure point of view, they are continuous.

Judging from the usage effect, the search speed is slow, so in actual development, tree structures are often used to optimize linked lists (AVL, red-black tree)

Addition and deletion are very efficient

Method 1: Add at the end of the linked list

Method 2: Join according to size

In the singly linked list state, locate temp to the previous node of the node to be deleted.

temp.next = temp.next.next

Consider the case where the node to be deleted is not found: temp.next.no = no

Define auxiliary variables, find the node, consider the situation where it cannot be found, and give a prompt

Define auxiliary variables to help traverse

while, when temp.next == null, the traversal ends

while, when temp.next == null, the traversal is completed

Suppose n people numbered 1, 2,...n sit in a circle, and it is agreed that the person numbered k (1=<k<=n) starts counting from 1, and the person who counts to m comes out of the queue, and the next person The bits start from 1 again, m is dequeued, and so on until everyone is dequeued.

One-way linked list, locate the node before the child who wants to leave the circle

temp locates the node before first

Subtopic 3

Subtopic 4