MindMap Gallery Data structure mind map
A picture helps you understand the data structure. Data structures are the way computers store and organize data. A data structure refers to a collection of data elements that have one or more specific relationships with each other. Often, carefully selected data structures can lead to higher operating or storage efficiency. This map is based on Yan Weimin's book Data Structures. If it helps you, you might as well give me a like with your fingers!
Edited at 2019-01-08 03:06:29Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
data structure
Overview
data
Data elements are basic units
A data item is the smallest unit of data
algorithm
feature
Finiteness
correctness
feasibility
enter
output
Design requirements
correctness
readability
Robustness
Efficiency and low storage requirements
time complexity
Difference logn, n, n^2,1
space complexity
linear table
Sequence table
Structural features
There is a unique first data element
The last data element exists
Each has a predecessor except the first
Except the first, each has a successor
Sequential representation and implementation
Single list
Node insertion
Node deletion
static linked list
circular linked list
Doubly linked list
Node insertion
Node deletion
restricted linear table
stack
application
postorder evaluation
mid-order to late-order
Convert mid-order to pre-order (pre-order evaluation)
queue
Implementation of circular queue
Arrays and generalized tables
storage
Compression of symmetric matrices
Trees and Binary Trees
basic concepts
Node
Spend
The number of subtrees of the node
leaf node
node with degree 0
forest
Tree
Binary tree
five basic forms
empty binary tree
Binary tree with only root node
Binary tree with empty right subtree
A binary tree in which both the left and right subtrees are not empty
Binary tree with empty left subtree
nature
1. The i-th layer has at most 2 i-1 power nodes.
2. The depth is k, and there are at most 2 to the kth power minus one node.
3.N0=N2 1
The depth of a complete binary tree with n nodes is ㏒n-1 (the base is 2)
The relationship between the left and right children of a complete binary tree and the root node
storage structure
chain storage structure
In a binary linked list containing n nodes, there are 2n link domains and n 1 empty link domains.
Traverse
preorder traversal
Visit the root node first
inorder traversal
Intermediate access to the root node
Postorder traversal
Last visited root node
Threading and its storage structure
Add two flag fields, flag 0 points to the child, flag 1 points to the successor
Ordinary tree
Conversion of trees and binary trees
child brother representation
Traverse
Root traversal first
Visit the root node first, and then traverse the subtree root-first.
back root traversal
First traverse the subtree from root to root, and then visit the root node.
forest
Conversion between forest and binary tree
child brother representation
Traverse
preorder traversal
Visit the root node of the first tree in the forest Pre-order traverse the subtree forest of the root node in the first tree Preorder traversal of the forest excluding the first tree
inorder traversal
similar
Optimal binary tree (Huffman tree)
Calculation of WPL
picture
diagram concept
Graph storage structure
adjacency matrix
adjacency list
cross linked list
adjacency multiple list
Graph traversal
DFS
BFS
minimum spanning tree
Prim
Kruskal
directed acyclic graph
topological sort
AOV
AOE
Critical Path
shortest path
Dijkstra's algorithm
Freud's algorithm
Find
Find concept
static search
half search
decision tree
Binary sorting tree
balanced binary tree
LL
LR
RR
RL
hash table
Construction method
Master the method of division with remainders
How to handle conflicts
open addressing method
Master linear probing and then hashing
rehash
chain address method
Create a public overflow area
Search efficiency
Hash function
How to handle conflicts
average search length
Hash table fill factor
α=number of records filled in the table/length of the hash table
Find
insertion sort
direct insertion sort
2-way insertion sort
table insertion sort
Hill sort
Unstable sorting
Bubble Sort
Quick sort
Best average time performance
selection sort
Simple selection sort
Heap sort
merge sort
Radix sort
stable sorting