Wondershare EdrawMind
MindMap Gallery Data structures and algorithms
- 20
Data structures and algorithms
Mind map of data structures and algorithms, specific content: Chapter 1 Data Structures Chapter 2 Sorting Algorithms Chapter 3 Bit Operations Chapter 4 Tree Chapter 5 Recursion Chapter 6 Backtracking Algorithm Chapter 7 Greedy Algorithm Chapter 8 Dual Pointers and Sliding Windows Chapter 9 DFS and BFS Chapter 10 Prefix sums Chapter 11 Dynamic Programming Chapter 12 Concurrent Search Chapter 13 Other Classic Algorithms
Edited at 2023-06-02 12:08:11
- Recommended to you
- Outline
"Boge's Algorithm Cheats"
Chapter 5 Recursion
Recursive understanding
Reverse linked list
Check if it is a palindrome linked list
Delete the nth node from the last linked list
Generate brackets
Binary tree expanded into linked list
Change binary search tree to cumulative
Chapter 6 Backtracking Algorithm
Backtracking algorithm usage template
Solve Sudoku
N Queen
combination of target values
combination
word search
Backtracking algorithm pruning
All arrangements with repeated numbers
Divide into k equal subsets
Chapter 7 Greedy Algorithm
Shortcomings of Greedy Algorithm
lemon change
Distribute cookies
Candy sharing problem
Minimum number of jumps
No overlapping area
Chapter 8 Dual Pointers and Sliding Windows
Opposing double pointers
palindrome
The container that holds the most water
Double pointers in the same direction
Move all 0's to the end of the array
The first common node of the two linked lists
Speed and slow double pointer
Determine whether there is a cycle in the linked list
Find the middle node of the linked list
resizable window
The longest substring without repeated characters
Minimum covering substring
contiguous subarray with minimum length
fixed window
Subarray with the largest mean
Find anagrams in a string
Maximum value in subarray
Only increase windows but not decrease them
Maximum consecutive 1 number
The longest repeated character after replacement
fruit in basket
Chapter 9 DFS and BFS
BFS usage panel
DFS usage panel
Number of islands
surrounded area
The maximum area of the island
rotten apple
Remove invalid brackets
Number of provinces
Chapter 10 Prefix sums
One-dimensional prefix sum
Two-dimensional prefix sum
subarray whose sum is K
K odd subarrays
length of consecutive arrays
subarray whose sum is divisible by K
The path whose sum is K
Chapter 11 Dynamic Programming
Dynamic programming explanation
Exchange change (1)
Kings and gold mines
Problem-solving ideas
backpack problem
01 Backpack problem
complete knapsack problem
Multiple knapsack problem
state compression
combination and arrangement
Exchange change (2)
The sum is the combination of the target value (4)
Word Splitting (1)
backpack exercise
Target sum (01 backpack)
Equalizer set (01 backpack)
Least perfect square number (complete knapsack)
Other exercises
longest common substring
longest common subsequence
Different paths in the grid
largest square
longest ascending subsequence
Chapter 12 Concurrent Search
The use of union search
Union search optimization
Union search path compression
Merge optimization by size
Merge optimization by rank
Number of islands
surrounded area
Number of provinces
number of enclaves
Chapter 13 Other Classic Algorithms
KMP algorithm
horse drawn cart algorithm
Moore voting algorithm
Sieve of Ehrlich
greatest common divisor of two numbers
Operations on arithmetic expressions
Parentheses method for converting infix expressions
Binary tree method for converting infix expressions
Binary tree method for converting infix expressions
Convert infix expression to postfix expression
Postfix expression evaluation
Prefix expression evaluation
Newton's iteration method for finding square roots
Base64 encoding
Chapter 4 Tree
DFS traversal of binary tree
Preorder traversal
inorder traversal
Postorder traversal
BFS traversal of binary tree
Morris Traversal of Binary Tree
Traversal of N-ary tree
Binary tree level traversal exercises
Right view of binary tree
The leftmost node and the rightmost node of the binary tree
The sum of all left leaf nodes in the binary tree
cousin node
A node that has no siblings
complete binary tree check
Binary tree maximum width
Properties of Binary Trees Exercises
The maximum depth of a binary tree
Maximum depth of N-ary tree
Minimum depth of binary tree
same tree
Symmetric binary tree
Determine subtree
cousin node
Verify binary search tree
Depth-first search exercises for binary trees
Use templates
balanced binary tree
The maximum path sum of a binary tree
diameter of binary tree
The longest path with the same value
Maximum product of split binary tree
Merge binary trees
Prune a binary tree
Construction of binary tree
Construct a binary tree from preorder and inorder traversal sequences
Construct a binary tree by traversing a sequence in inorder and postorder
Construct a binary tree from pre-order and post-order traversal sequences
Construct a binary tree from pre-order and post-order traversal sequences
Common ancestor of binary trees
The most recent common ancestor of a binary tree
nearest common ancestor of binary search tree
Chapter 3 Bit Operations
Common operators
Common operations of bit operations
Swap the values of two numbers
Numbers that appear only once
Finite State Machine
Number of 1's in binary
total number of bits
reverse binary
Powers of 2
alternating binary numbers
Bitwise AND of numeric ranges
Maximum product of string lengths
after two integers
all subsets of the set
Chapter 2 Sorting Algorithms
Bubble Sort
selection sort
insertion sort
Quick sort
merge sort
Heap sort
bucket sort
Radix sort
Hill sort
counting sort
Chapter 1 Data Structures
array
one-dimensional array
Multidimensional Arrays
scrolling array
difference array
tree array
linked list
one-way linked list
Doubly linked list
circular linked list
Jump table
XOR linked list
queue
General queue
circular queue
deque
stack
hash table
Tree
Binary tree
full binary tree
complete binary tree
binary search tree
AVL tree
red black tree
dictionary tree
Huffman tree
Segment tree
Cartesian tree
heap
max heap
min heap
picture
Introduction to Figures
Graph traversal
Dijkstra's algorithm
Bellman-Ford algorithm
SPFA algorithm
Floyd algorithm
Prim's algorithm
Kruskal algorithm
Boruvka algorithm
topological sort
wansuanfa.com