MindMap Gallery data structure
Here comes the knowledge about data structures! The knowledge of data structure is complicated and difficult to understand, and many people have no way to start during the final review. The following figure provides a detailed summary and summary of knowledge points such as basic concepts of data structure, linear tables, stacks and queues, trees and binary trees, and search techniques. Easily get high marks in the final exam!
Edited at 2019-12-31 06:06:19Avatar 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
Basic concepts of data structure
data
data element
The smallest data element is a data item
data structure
logical structure
storage structure
cis storage structure
linked storage structure
linear table
Sequence table
Single list
stacks and queues
First in, last out
top of stack
Can be inserted and deleted
bottom of stack
Inoperable
queue
first in first out
Team leader
Dequeue
tail of the queue
Join the team
Trees and Binary Trees
Binary tree
Several special binary trees
leaning tree
full binary tree
complete binary tree
Binary tree traversal
prologue
mid-order
Afterword
sequence
Binary tree storage structure
cis storage structure
Binary linked list
optimal binary tree
Huffman algorithm
with full path length
The sum of path length and node weight product
Huffman tree (optimal binary tree)
Minimum total path length
A Huffman tree with n leaf nodes has 2n-1 nodes.
Construct Huffman tree
Recursively merge the two smallest weight nodes
Huffman coding
Equal length encoding
n characters require log2 n
Unequal length encoding
Heap and priority queue
The value of each node is less than or equal to the value of its left and right children (small root heap), otherwise it is a large root heap.
The logical structure of the graph
basic terminology
degree in degree out degree
undirected complete graph
An undirected complete graph with n vertices has n ✖️ (n-1)/2 edges
Directed complete graph
A directed complete graph with n vertices has n ✖️ (n-1) edges
connected graph
Any vertex of an undirected graph has a path
connected components
Maximum connected subgraph of an undirected unconnected graph
Strongly connected graphs and strongly connected components
Analogy to the above is strongly applicable to directed graph scenarios.
Graph traversal
Depth-first traversal of DFT
in turn
Breadth First Traversal BFT
by layer
Graph storage structure
adjacency matrix
The time complexity of both depth traversal and breadth traversal is O (n^2
The space cost is O (n^2
adjacency list
The time required to find all adjacent points of a vertex is O ( e ). The time complexity of both depth traversal and breadth traversal is O ( n e
The space cost is O ( n e
minimum spanning tree
Prim's algorithm
Starting from the starting point, find the nearest
Kruskal algorithm
Add the shortest edge and merge until connected
shortest path
Dijkstra's algorithm
Generate shortest paths in order of increasing length
directed acyclic graph
AOV net and topological sorting
AOV
Vertices represent activities and arcs represent priority relationships between activities.
topological sort
A sequence from the starting point to the end point is topological sorting
AOE net critical path
AOE
Compared with AOV network, paths carry weights
Critical Path
The path of an activity whose earliest start time is equal to its latest start time
key activities
Activities on the critical path
Find technology
Linear table lookup technique
Sequential search O(n
Halfway search O(log2n
Tree table lookup technology
Binary sorting tree
All nodes in the left subtree have values less than the root node
All nodes in the right subtree have values greater than the root node
The left and right subtrees are also binary sorted trees
Lookup performance is between O(log2n) and O(n)
balanced binary tree
The depth of the left and right subtrees of the root node is at most different
The left and right subtrees of the root node are also balanced binary trees.
Imbalance adjustment
LL
Rotate clockwise to change the position of the subtree
RR
Rotate counterclockwise to change the position of the subtree
LR
Left subtree counterclockwise, then change the subtree position
Overall clockwise, change the position of the subtree
RL
Right subtree clockwise, then change the subtree position
Overall counterclockwise, change the position of the subtree
Hash table lookup technology
hash function
direct addressing method
divide and leave remainder method
Square-Medium Method
How to handle conflicts
open addressing method
average search length
sorting techniques
insertion sort
direct insertion sort
Suitable for basic ordered sequences
Hill sort
swap sort
bubble sort
Quick sort
selection sort
Simple selection sort
Heap sort
merge sort
Two-way merge sort
Applicable to a large number of sequences
time complexity
Direct insertion sort, simple selection sort, bubble sort
O(n^2
Heap sort Quick sort Merge sort
O(nlog2n
Hill sort
O(n^2)~O(nlog2n
space complexity
merge sort
O(n
Quick sort
O(log2n)~O(n
other
O(1
stability
Stablize
Direct insertion sort Bubble sort Merge sort
unstable
Hill sort Quick sort Simple selection sort Heap sort