MindMap Gallery Data Structures and Algorithms
The outline of data structures and algorithms is concise and clear, helping you avoid detours on the way to learning data structure algorithms.
Edited at 2020-08-24 16:17:36Avatar 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 Structures and Algorithms
Base
sparse array
Conversion between arrays and sparse arrays, compressed storage of data
queue
ring queue
linked list
Single list
Doubly linked list
Circular linked lists and Joseph's problem
stack
First in, last out
Tree
basic part
Binary tree
Sequential storage of binary trees
threaded binary tree
Practical application
Heap sort
huffman tree
Huffman coding
Binary sort tree (BST)
Balanced Binary Tree (AVL)
multi-way search tree
Multi-tree and B-tree
22-3 tree
B-tree, B-tree, B*-tree
red black tree
picture
basic terminology
complete graph
dense graph
sparse graph
connected graph
Strongly connected graph
connected components
Quanhe.com
storage structure
adjacency matrix
Adjacency matrix array is used to represent the storage structure of adjacency relationship.
adjacency list
Combining sequential and chained storage
inverse adjacency list
Graph traversal
Depth-first traversal (DFS)
Breadth-first traversal (BFS)
Traversal of disconnected graphs
Sorting Algorithm
Bubble Sort
selection sort
insertion sort
Hill sort
Quick sort
merge sort
Radix sort
Heap sort
Find algorithm
binary search
interpolation search
Fibonacci search
Advanced algorithms
divide and conquer
Tower of Hanoi problem
recursion
Maze, Eight Queens Problem
Backtrack
Knight travel problem
dynamic programming
backpack problem
greedy
Collection coverage problem
string matching
Brute force matching algorithm
KMP algorithm
shortest path
Dijkstra's algorithm: the shortest path from one vertex to all other vertices
Floyd's algorithm: shortest path between each pair of vertices
Spanning tree and minimum spanning tree
Minimum spanning tree of a graph: The tree with the smallest sum of edge weights among all spanning trees.
Connected components and minimum spanning trees of undirected graphs
Prim's algorithm: road construction problem
Kruskal algorithm: bus problem