MindMap Gallery Data structure mind map
This is a mind map about data structure, including linear tables, strings and arrays, trees and binary trees, etc. The most detailed review system knowledge points summary chart is very practical.
Edited at 2021-06-27 18:15:46Avatar 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
introduction
Data structure research content
Basic concepts and terminology
Data, data elements, data items and data objects
data structure
logical structure
Set structure
linear structure
General linear table
special linear table
Generalization of linear tables
tree structure
Tree
Binary tree
graph structure
Undirected graph
directed graph
storage structure
sequential storage
chain storage
Data types and abstract data types
Representation and implementation of abstract data structures
Algorithms and Algorithmic Analysis
summary
linear table
Applications of linear tables
Merge of linear tables
Merge of ordered lists
Linked representation and implementation of linear tables
Implementation of basic operations of singly linked list
1. Initialization 2. Value 3. Delete, 4. Search 5. Insert 6. Create a singly linked list
circular linked list
End to end
Doubly linked list
There are two pointer fields
Definition and representation of singly linked list
data field, pointer field
Sequential representation and implementation of linear tables
Storage representation of linear table
Data structure: length holds the number of elements, * pointer holds the array
Implementation of basic operations in sequence tables
1. Initialization 2. Value 3. Delete, 4. Search 5. Insert
Moving elements in the sequence table: times x=n-i 1. The i-th element also needs to be moved.
Comparison of sequence list and linked list
Time complexity comparison
1. Find the basic statements in the algorithm 2. Calculate the order of magnitude of the number of executions of the basic statements 3. Use the O mark to indicate the time performance of the algorithm
Space complexity comparison
space occupied
stacks and queues
Definition and characteristics of stack and queue
Definition and characteristics of stack
Queue definition and characteristics
Queue representation and implementation of operations
Stack representation and operation implementation
Queue type definition
Circular queue------Sequential representation and implementation of queue
storage structure
sequential representation
chain representation
initialization
Find the length of the circular queue
Join the team
Dequeue
Get the head element
Chain queue---chain representation and implementation of queue
Stack and recursion
Strings and arrays
array
Sequential storage of arrays
Address = loc(0.0) (n*i j)L//Note whether i,, j starts with 0 or 1. Note whether it is row storage or column storage.
Compressed storage of special matrices
Address=j*(j 1)/2 i
string
pattern matching algorithm
bf algorithm
Required data: position, i, j, steps: initialization, determine whether the comparison reaches the end, continue to compare subsequent characters, the pointer goes back and restarts matching, returns the position if the match is successful, returns 0 if it fails; i-(j-1) is the beginning position so return i=i-j 2
kmp algorithm
Find next array
storage structure
generalized table
generalized table
H is an element and T is a list
Trees and Binary Trees
Definition of tree and binary tree
Properties and storage structure of binary trees
Properties of binary trees
Number of nodes
node relationship
full binary tree
complete binary tree
Traverse binary trees and clue binary trees
Traverse
preorder traversal
inorder traversal
First hit recovery method
Postorder traversal
Restoration method
clue binary tree
Huffman tree and its applications
Basic concepts of Huffman numbers
Huffman tree construction algorithm
Huffman coding
Abstract data type definitions for trees and binary trees
trees and forest
tree storage structure
Conversion between forest and binary tree
Tree to binary tree: connections between brothers, keeping the connection to the first child
Binary tree to tree: remove the connection between the right child of the left child and the right child is connected to the root node
Forest to binary tree: first convert to a binary tree, then connect the root nodes to convert to a tree, and then convert to a binary tree
Tree and forest traversal
Tree traversal: root traversal first, then root traversal
Forest traversal: pre-order traversal, in-order traversal
picture
Application of diagrams
minimum spanning tree
Kruskal algorithm
Implementation steps
Prim's algorithm
Implementation steps
shortest path
Dijkstra's algorithm
Floyd algorithm
topological sort
step
Critical Path
The earliest start time of the event
The latest occurrence time of the event
The earliest start time of the event
The latest start time of the event
Figure type
directed graph
Undirected graph
Definition and basic terminology of graphs
subplot
Undirected complete graph and directed complete graph
Sparse graphs and dense graphs
Quanhe.com
Path and path length
loop or ring
Connected graphs and connected components
Spanning tree of connected graph
Directed trees and generated deep forests
Graph storage structure
Adjacency matrix notation
adjacency list notation
adjacency list
inverse adjacency list
cross list method
adjacency multiple list
Graph traversal
depth first search
breadth first search
sort
The concept of sorting
Classification of internal sorting methods
How to store records to be sorted
Evaluation criteria for sorting algorithm efficiency
swap sort
Bubble Sort
algorithm
Quick sort
algorithm
selection sort
Simple selection sort
tree sort
Heap sort
Initial build pile
adjust heap
screening method
Radix sort
Multiple keyword sorting
chained radix sort
external sort
Basic methods of external sorting
Implementation of multi-way balanced merging
permutation-selection sort
best merge tree
merge sort
insertion sort
direct insertion sort
concept
algorithm
half insertion sort
algorithm
Hill sort
algorithm
Find
linear search
sequential search
binary search
Build decision tree
Block search
Index storage structure
algorithm
tree structure
Binary sorting tree
Find algorithm
insertion algorithm
Delete algorithm
binary balanced tree
insert
balance factor bf
balanced rotation
RR,LL type
LR type
LR (L) type
LR(R) type
RL type
LR (L) type
LR(R) type
algorithm
B-tree (multi-way balanced search)
B-tree
Hash lookup
The concept of hash table
Hash lookup
Hash collision
loading factor
The hash function used
Design a hash function
direct addressing method
division leaving remainder method
digital analytics
conflict resolution methods
open addressing method
Linear detection method
square detection method
pseudorandom number sequence
chain address method
concept
static search
dynamic search
lookup table