MindMap Gallery Overall mind map of data structure
The data structure mind map is suitable for postgraduate entrance examination, work, and interview review. It can serve as an outline and an outline~
Edited at 2021-08-13 11:08:28Avatar 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
1 Introduction
1.1 Basic concepts of data structure
1.1.1 Data
1.1.2 Data elements
1.1.3 Data items
1.1.4 Data objects
1.1.5 Data structure
1.2 Algorithms and algorithm evaluation
1.2.1 Time complexity
1.2.2 Space complexity
2. Linear table
2.1 Definition and basic operations of linear tables
2.2 Sequential representation of linear tables
2.2.1 Static allocation
2.2.2 Dynamic allocation
2.3 Chained representation of linear tables
2.3.1 Single linked list
2.3.2 Double linked list
2.3.3 Circular linked list
2.3.4 Static linked list
3. Stack and Queue
3.1 Stack
3.1.1 Sequential storage
3.1.2 Chain storage
3.2 Queue
3.2.1 Sequential storage
3.2.2 Chain storage
3.2.3 Double-ended queue
3.3 Application of stack and queue
3.3.1 Stack
3.3.1.1 Bracket matching
3.3.1.2 Expression evaluation
3.3.1.3 Application of stack in recursion
3.3.2 Queue
3.3.2.1 Application of queue in multiplicative traversal
3.3.2.2 Application of queues in computer systems
3.4 Storage and compression of special matrices
3.4.1 Matrix storage structure
3.4.2 Compression structure of matrix
4. skewers
4.1 Definition and implementation of string
4.2 String pattern matching
4.2.1 Naive version of pattern matching
4.2.2 Improved Pattern Matching (KMP)
8. Sorting
8.1 Basic concepts of sorting
8.2 Algorithm ideas and code implementation
8.3 Performance parameters
8.3.1 Time complexity
8.3.1.1 Best time complexity
8.3.1.2 Worst time complexity
8.3.1.3 Average time complexity
8.3.2 Space complexity
8.3.2.1 Best
8.3.2.2 Worst
8.3.3 Stability
8.3.4 Applicability
8.4 Internal sorting
8.4.1 Sorting based on comparison classes
8.4.1 Insertion class sorting
8.4.1.1 Direct insertion sort
8.4.1.2 Half-way insertion sort
8.4.1.3 Hill sorting
8.4.2 Exchange sorting
8.4.2.1 Bubble sort
8.4.2.2 Quick sort
8.4.3 Select class sorting
8.4.31.Simple selection sorting
8.4.3.2 Heap sort
8.4.5 Merge class sorting
8.4.5.1 Merge sort
8.4.2 Sorting based on non-comparison classes
8.4.2.1 Counting sort
8.4.2.2 Bucket sorting
8.4.2.3 Radix sort
8.5 External sorting
8.5.1 Basic concepts of external sorting
8.5.2 Common methods of external sorting
8.5.2.1 Merge sort
8.5.3 Multi-way balanced merging and loser tree
8.5.4 Permutation selection sorting
8.5.5 Optimal merge tree
8.6 Comparison and application of various sorting algorithms
7. Find
7. 1 Basic concepts of search
7.2 Common search categories
7.2.1 Sequential search
7.2.2 Half search
7.2.3 Block search
7.3 B-trees and B-trees
7.3.1 Basic concepts
7.3.2 Basic operations
7.4 Hash table
7.4.1 Basic concepts
7.4.2 Construction method of hash function
7.4.3 Methods of handling conflicts
7.4.4 Hash search and performance analysis
6. Figure
6.1 Basic concepts of graphs
6.2 Storage and basic operations of graphs
6.2.1 Adjacency matrix method
6.2.2 Adjacency list method
6.2.3 Cross linked list
6.2.4 Adjacency multiple lists
6.2.5 Basic operations on graphs
6.3 Graph traversal
6.3.1 Breadth-first search
6.3.2 Depth-first search
6.4 Application of diagrams
6.4.1 Minimum spanning tree
6.4.2 Shortest path
6.4.3 Topological sorting
6.4.4 Critical path
6.4.5 Directed acyclic graph description expression
5. Trees and binary trees
5.1 Basic concepts of trees
5.1.1 Main characteristics of trees
5.2 Concept of binary tree
5.3 Binary tree traversal and clue binary trees
5.4 Trees and forests
5.4.1 Number storage structure
5.4.2 Transformation of numbers, forests and binary trees
5.4.3 Tree and forest traversal
5.5 Applications of trees and binary trees
5.5.1 Union search