Wondershare EdrawMind
EdrawMinddata structure
MindMap Gallery data structure
- 8
data structure
A mind map about data structure. The algorithm characteristics include input, output, finiteness, certainty, and feasibility. This map shares the knowledge of linear tables, trees, and graphs.
Edited at 2023-06-21 10:48:44- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- Project Management Process Template
Project management is the process of applying specialized knowledge, skills, tools, and methods to project activities so that the project can achieve or exceed the set needs and expectations within the constraints of limited resources. This diagram provides a comprehensive overview of the 8 components of the project management process and can be used as a generic template for direct application.
data structure
- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- Project Management Process Template
Project management is the process of applying specialized knowledge, skills, tools, and methods to project activities so that the project can achieve or exceed the set needs and expectations within the constraints of limited resources. This diagram provides a comprehensive overview of the 8 components of the project management process and can be used as a generic template for direct application.
- Recommended to you
- Outline
data structure
basic concept
algorithm
Algorithm characteristics
enter
output
Finiteness
certainty
feasibility
Algorithm design requirements
correctness
readability
Robustness
High time efficiency and low storage volume
time complexity
space complexity
recursion
linear table
storage structure
sequential storage
chain storage
static linked list
Described by an array
Single list
Doubly linked list
circular linked list
When using fixed-length array storage, in order to distinguish between empty and full situations, it is generally required that the tail pointer cannot have elements (so the table length must be smaller than the array length)
head pointer
operate
insert
Find
static lookup table
binary search
Hash table (Hash table)
Hash function construction
digital analytics
Square-Medium Method
division leaving remainder method
folding method
random number method
Conflict handling
open address law
Hash function method
chain address method
public overflow method
dynamic lookup table
Performance analysis
index
dense index
block index
Inverted index
sort
Basic sorting
Bubble Sort
insertion sort
selection sort
Improve sorting
Quick sort
The coefficient before time complexity is smaller than that of heap sort
Hill sort
Heap sort
Big/small top pile
merge sort
bucket sort
counting sort
application
polynomial operations
stack
application
Expression evaluation
prefix expression
suffix expression
calculate
Encountered numbers pushed onto the stack
When an operator is encountered, the result of the operation on the top two elements of the stack is pushed onto the stack.
Convert infix to suffix
encounter digital output
operator encountered
If the priority is higher than the top of the stack, it will be pushed onto the stack.
Parentheses have the lowest priority
Otherwise output
When encountering a left bracket, push it onto the stack
When a right parenthesis is encountered, it is popped from the stack in sequence until a left parenthesis is popped from the stack.
queue
string
pattern matching
Naive pattern matching
KMP pattern matching
nextarray
overall match
Tree
storage structure
parent representation
child representation
child brother representation
Classification
full binary tree
All branch nodes have left and right subtrees
complete binary tree
The node numbering in hierarchical order is the same as that of a full binary tree.
Binary tree
Convert ordinary tree to binary tree
Use child sibling notation
child node on the left
The first sibling node is outside
Convert forest to binary tree
Add a common virtual root node to convert to a normal tree and then to a binary tree
Traverse
Pre-order, in-order traversal or mid-order and post-order traversal can determine a tree (but pre-order and post-order traversal cannot)
Binary tree traversal
precedence
Visit the root node first and then traverse the left and right subtrees
mid-order
First traverse the left subtree, then visit the root node, and finally traverse the right subtree.
Afterword
First traverse the left and right subtrees, then visit the root node
sequence
tree traversal
Root traversal first
Preorder traversal can be used in binary tree representation
back root traversal
In-order traversal can be used in binary tree representation
forest traversal
precedence
mid-order
Optimal binary tree (Huffman tree)
All weighted paths and the minimum
path length
The number of nodes passed from the root node to the given node (=number of layers-1)
weighted path length
The weight of the node multiplied by the path length
algorithm
Nodes are sorted by weight from small to large.
Take the smallest two nodes as the child nodes of the new node, and the weight of the new node is the sum of the weights of the two nodes.
Add new nodes and repeat the above process until there is only one node left.
Huffman coding
It is necessary to ensure that any character encoding is not a prefix of another character encoding
Construct Huffman tree using character frequency as weight value
Encoded as a sequence of 0s and 1s (left and right) along the path branches from the root node to the leaves
Binary sorting tree
definition
If the left subtree is not empty, the values of all nodes on the left subtree are less than the value of the root node.
If the right subtree is not empty, the values of all nodes on the right subtree are greater than the value of the root node.
The left and right subtrees are also binary sorted trees.
Balanced binary tree (AVL tree)
definition
A binary sorted tree in which the height difference between the left subtree and the right subtree of each node is less than or equal to 1
balancing factor
The height of the left subtree minus the height of the right subtree
Can only be 1,0,-1
rotate
Select the smallest unbalanced subtree (closest to the inserted node and the absolute value of the balance factor is greater than 1)
Multi-way search tree (B-tree)
red black tree
picture
storage structure
adjacency matrix
adjacency list
cross linked list
adjacency multiple list
edge set array
Traverse
breadth first
depth first
minimum spanning tree
Prim's algorithm
Kruskal algorithm
shortest path
Dijkstra's algorithm
Floyd algorithm
Directed Acyclic Graph (DAG)
topological sort
AOV network
Critical Path
AOE network