MindMap Gallery Algorithms and Data Structures
The mind map of algorithms and data structures includes: 1. Introduction; 2. Linear tables; 3. Queues; 5. Sorting; trees and binary trees, etc.
Edited at 2021-11-20 16:09:54This 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.
Algorithms and Data Structures
1. Introduction
Logical structure division and characteristics
gather
linear table
Tree
picture
storage structure
sequential storage structure
chain storage structure
time complexity
T(n)=O(n^m)
2. Linear table
Sequence table
linked list
Determine whether it is empty
Linear table in-place inversion
Sequence table
linked list
3. Queue
The difference and connection between stack and queue
What kind of fields can be generated by pushing fields a, b, and c onto the stack? (5 types)
Which types of queues 1 2 3 4 join the queue (1 type)
circular queue
Team is empty
Team is full
Trees and Binary Trees
Quick sort
selection sort
direct insertion sort
half insertion sort
colon sort
Find
half search
Binary sorting tree
Hash table
chain address method
5. Sorting
In the binary tree, there are 37 double-branch nodes, 5 single-node branch nodes, and the number of leaf nodes is (38) N (leaf) = n (double branch) 1
complete binary tree
Example: There are 4096 nodes. The number of leaves is (2048). The number of nodes is an odd number plus one and divided by two, and an even number is divided by two.
Huffman tree
1999 nodes and the number of leaf nodes is 1000
Binary tree
precedence
mid-order
Afterword
Huffman coding