MindMap Gallery Data structure notes
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. The picture below shows the notes on the data structure. It roughly records the main content of different chapters and is only an overview.
Edited at 2020-10-21 20:04:59Avatar 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
structure
logical structure
gather
Linear
tree shape
graphic
storage structure
sequential storage
chain storage
Algorithmic Rating
basic standards
time complexity
space complexity
linear table
Definition and implementation
Two storage structures
sequential storage
Master the algorithm
value
Find location
insert
delete
chain storage
Knowledge points mastered
Algorithmic operations
Single list
value
Find
insert
delete
Traverse etc.
create
Front insert (stack)
Cut in behind (queue)
circular linked list
insert
delete
Traverse etc.
Algorithms for implementing other operations on linear tables
Doubly linked list
insert
delete
Traverse etc.
Algorithms for implementing other operations on linear tables
Application comparison
Compare
storage density
time performance
Linear table merge
unordered list
ordered list
chain order
From the perspective of time complexity and space complexity, the characteristics of linear tables under sequential and chained storage structures and their respective use occasions are comprehensively considered.
stacks and queues
sequence stack
pit stop
outbound
Get elements
Characteristics of full and empty
chain stack
pit stop
outbound
Get elements
Characteristics of full and empty
recursion
circular queue
principle
Queue full and empty conditions
pit stop
outbound
Get elements
chain queue
Join the team
Dequeue
Get elements
Characteristics of accessing data
Arrays and generalized tables
Row first
Column first
Solve the address of an array element in a multi-dimensional array
string
storage structure
sequence string
Chain string
pile of strings
BF algorithm
KMP algorithm
next value
Correct next value
array
definition
sequential storage
Compressed storage
special matrix
Symmetric matrix
compression
storage
triangular matrix
compression
storage
diagonal matrix
compression
storage
sparse matrix
Triad
Row logically linked sequence table
Cross linked list storage
generalized table
concept
Header and footer definitions
Two forms of chain storage
Head and tail linked list
Extended linear table storage
Trees and Binary Trees
Binary tree
Binary tree definition
Definition of special binary tree
complete binary tree
full binary tree
clue binary tree
structure
Traverse
sequence first
mid-order
Afterword
Two storage structures
sequential storage
chain storage
two-insert linked list
Traversal mode
sequence first
mid-order
Afterword
Construction of binary tree
pre-order sequence
post-order sequence
copy binary tree
Calculate depth
Number of nodes
Three storage methods
parent representation
child representation
child brother representation
forest
express
Traverse
precedence
Afterword
Convert
Huffman tree
construction process
Huffman coding principle
picture
Definitions of graphs and related terms
Three storage structures
array notation
adjacency list
cross linked list
Two traversal methods
depth first search
breadth first search
Graph related applications
minimum spanning tree
Prim's algorithm
Luxka algorithm
topological sort
Critical Path
shortest path
Dijkstra's algorithm
Freud's algorithm
Understand algorithm principles and practical problems solved
Find
Two storage tables
static search
Features
Related operations
Sequence table
Search in ordered list Half search
Search principle of index sequence table
Ability to analyze search performance using the concept of average search length
dynamic lookup table
Features
Related operations
Binary sorting tree
definition
construction process
insert
delete
Performance analysis
binary balanced tree
definition
Construct
LL
LR
RR
RL
B-tree
definition
insert
delete
Performance analysis
Hash tree
definition
Construction method
How to deal with conflicts
Search and performance analysis
sort
Definition of sort
Definition of stable and unstable
Sorting Algorithm
insertion sort
insert directly
Insert in half
Hill sort
principle
application
swap sort
Bubble Sort
principle
application
Quick sort
principle
application
selection sort
Simple selection sort
principle
application
Heap sort
principle
application
merge sort
principle
application
Radix sort
external sort