MindMap Gallery Data and data structures
This is a mind map about data and data structure. The main contents include: Chapter 6: Composition of data in the era of big data, Chapter 5: Data structure and algorithm, Chapter 4: Tree, Chapter 3: String , queue and stack, Chapter 2: Arrays and linked lists, Chapter 1: Data and data organization.
Edited at 2024-02-13 18:50:35This 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 and data structures
Chapter 1: Data and Data Organization
data
Numbers: They have no meaning in themselves and have no quantitative meaning. They only have specific practical meaning in specific situations.
Numeric value: data composed of numerical symbols, with quantitative meaning, and capable of arithmetic operations
Data organization
Data element: the basic unit of data
Data types: basic data types and structural data types
Data structure: the relationship between data, that is, the organization form of data
Chapter 2: Arrays and Linked Lists
array
Concept: a sequence composed of variables of the same type
One-dimensional array: suitable for representing data sequences with linear characteristics
characteristic
Array elements have the same data type
Access the value of array elements through array name and subscript
Store empty fixed space
linked list
Concept: A data structure that connects data objects that need to be processed in the form of nodes through pointers.
characteristic
The structure of each node in the same linked list is the same
Each linked list must have a head pointer to implement reference and boundary processing of the linked list
The space occupied by the linked list is not fixed
Chapter 3: Strings, Queues and Stacks
string
Concept: A finite sequence of zero or more characters
characteristic
finite seriality
String comparability
queue
Concept: A first-in, first-out linear list. The end that allows insertion is called the tail of the queue, and the end that allows deletion is called the head of the queue.
characteristic
First in, first out, last in, last out
finite seriality
stack
Concept: A linear table with restricted operations, allowing insertion or deletion only at one end of the table
characteristic
First in, last out, last in, first out
finite seriality
Chapter 4: Tree
Trees and Binary Trees
The concept of tree: It can be described as a finite set composed of n (n>=0) nodes and a node relationship defined on the set.
The concept of a binary tree: it is a finite set with n nodes
Binary tree properties
There are at most 2 k-1 power nodes on the kth layer.
A binary tree with depth k has at most 2 k - 1 nodes.
n0=n2 1
Basic operations of binary trees
Complete binary tree and incomplete binary tree
Traverse
Preorder traversal: around the root
In-order traversal: left root right
Postorder traversal: left and right roots
abstract data type
Chapter 5: Data Structures and Algorithms
Iteration and recursion
The concept of iteration; an activity that repeats a feedback process, usually with the goal of bringing results in line with goal expectations
Data sorting
Bubble Sort
Data lookup
sequential search
binary search
Chapter 6: Composition of data in the era of big data
Organization of data in real-time query systems
Organization and application of POI data