Data structure algorithm part

Sequence table

linked list

Single linked list head interpolation

tail interpolation

Single linked list query by value

Single linked list deletion by value

Single linked list printing

The output format corresponds to the meaning of the data type symbol
%d int outputs a signed decimal int type
%o unsigned int outputs octal The int type
%x unsigned int outputs the decimal int type, and the letters are output in lowercase
%X unsigned int outputs the decimal int type, and the letters are output in uppercase
%u unsigned int outputs a decimal unsigned integer
printf ("Format control string", output table item);
scanf ("Format control string", input item address list);

stack

Push into the

stack, pop out of the stack

, print the sequence stack,

chain stack,

push into the stack, pop

out of the stack.

queue

Circular queue

Circular queue enqueuing Circular queue

dequeuing Circular queue

printing

How to write the main function

Chain queue Chain queue

enqueuing Chain

team dequeuing

Chain queue printing

Tree

Definition of tree

Tree creation

Recursive traversal of

tree Non-recursive traversal of

tree Hierarchical traversal of tree

picture

Storage adjacency matrix of graph

Storage adjacency list of graph


Convert adjacency matrix to adjacency list

Depth-first traversal of adjacency list

Breadth-first traversal of adjacency list

Floyd's algorithm to find the shortest path

Implement topological sorting of adjacency list
Omitted

sort

Bubble Sort

Selection sort

Insertion sort

Hill sort

Quick sort Heap

sort

Merge sort

Bucket sort

Counting sort
Radix sort
Omitted