MindMap Gallery Data structure mind map
The study of data structures is mainly carried out through the introduction, arrays and generalized tables, trees and binary trees, graphs, search, linear tables, stacks and queues, strings and recursion.
Edited at 2022-05-22 00:06:28This 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!
This is a mind map about Deep Analysis of Character Relationships in Zootopia 2, Main content: 1、 Multi-layer network of relationships: interweaving of main lines, branch lines, and hidden interactions, 2、 Motivation for Character Behavior: Active Promoter and Hidden Intendant, 3、 Key points of interaction: logic of conflict, collaboration, and covert support, 4、 Fun Easter eggs: metaphorical details hidden in interactions.
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!
This is a mind map about Deep Analysis of Character Relationships in Zootopia 2, Main content: 1、 Multi-layer network of relationships: interweaving of main lines, branch lines, and hidden interactions, 2、 Motivation for Character Behavior: Active Promoter and Hidden Intendant, 3、 Key points of interaction: logic of conflict, collaboration, and covert support, 4、 Fun Easter eggs: metaphorical details hidden in interactions.
data structure
Arrays and generalized tables
array
sparse matrix
generalized table
Trees and Binary Trees
Basic concepts of trees
Concept and properties of binary trees
Binary tree storage structure
Basic operations of binary trees and their implementation
Binary tree traversal
Construction of binary tree
clue binary tree
Huffman tree
Solving Equivalent Problems Using Union-Find Sets
picture
Basic concepts of graphs
The storage structure and basic operation algorithms of graphs
Graph traversal
Spanning tree and minimum spanning tree
shortest path
topological sort
AOE network and critical path
Find
Basic concepts of search
Linear table search
Search in number table
Hash table lookup
recursion
what is recursion
Stack and recursion
Design of recursive algorithms
string
skewer concept
storage structure
pattern matching
stacks and queues
stack
queue
linear table
Linear table and its logical structure
sequential storage structure
chain storage structure
application
ordered list
introduction
What is data structure
Data structure definition
Data is a collection of numbers and characters that describe objective things
A data item is the smallest unit of data with independent meaning, also called a field or domain.
Data object refers to a collection of data elements with the same nature, which is a subset of data
Data structure refers to all data elements and the relationship between data elements. It can be regarded as a collection of data elements that have a certain relationship with each other.
Data structures usually include
logical structure of data
Composed of logical relationships between data elements
Data storage structure
The stored representation of data elements and their relationships in computer memory, also known as the physical structure of the data
Operations on data structures
operations applied to the data
logical structure
Representation of logical structure
Graphic representation
Use tables or graphics to directly describe the logical relationship of data
Two-tuple representation
Data logical structure representation, such as: B=(D, R). <x.y>, x is the predecessor element of y, and y is the successor element of x. If an element has no predecessor element, the element is called the beginning element; if there is no successor element, the element is called the terminal element. For symmetric pairs, round brackets can be used instead of angle brackets.
Type of logical structure
gather
linear structure
There is a one-to-one relationship between data elements. Its characteristic is that both the start element and the terminal element are unique.
tree structure
One-to-many relationship.
Graphical structure
many-to-many relationship
storage structure
sequential storage structure
The sequential storage structure uses a set of consecutive storage units to store all data elements. Advantages: high storage efficiency, random access to elements Disadvantages: Inconvenient to modify data
chain storage structure
Advantages: Easy to modify data Disadvantages: low storage space utilization, unable to perform random access to elements
Index storage structure
Advantages: High search efficiency. Disadvantages: Need to create index tables, thus increasing space overhead
Hash (or hash) storage structure
Advantages: fast search speed Features: It only stores data but not logical relationships. It is generally only suitable for occasions that require fast search and insertion of data.
Data types and abstract data types
Data type (c/c)
int type
The int type can have three modifiers, namely short (short whole sentence), long (long whole sentence) and unsigned (unsigned integer).
Boolean Boolean value type
float type
double type
char type
abstract data type ADT
It refers to the logical data structure and operations on the logical data structure that are abstracted from the mathematical model of the problem when the user designs the software system, without considering the specific storage structure of the computer and the specific implementation algorithm of the operation.
Algorithm and description
characteristic
Finiteness
certainty
feasibility
There is input
There is output
Design goals
data structure algorithm = program