1. Common data structure
Linear: Array, linked list, queue, stack, block array (array + linked list), hash table, two-terminal queue, Bitmap (bitmap)
Tree: Heap (large top heap, small top heap), Trie tree (Letter Tree or dictionary tree), suffix tree, suffix Tree Group, binary sort/lookup tree, B+/b-,avl tree, Treap, red-black tree, splay tree, Segment tree, tree-like array
Figure: Figure
Other: And check the collection
2. Common algorithms
(1) Basic ideas: enumeration, recursion, partition, simulation, greed, dynamic planning, pruning, backtracking
(2) Graph algorithm: Depth first traversal and breadth first traversal, shortest path, minimum spanning tree, topology sort
(3) String algorithm: String lookup, hash algorithm, KMP algorithm
(4) Sorting algorithm: Bubble, INSERT, select, Fast row, merge sort, heap sort, bucket sort
(5) Dynamic Programming: knapsack problem, longest common subsequence, optimal binary search tree
(6) Problem of number theory: Prime problem, Integer problem, transformation of binary, same Yu Mo operation,
(7) Permutation combination: permutation and combination algorithm
(8) Other: LCA and RMQ issues
Continue to add ...
Original articles, reproduced please specify: Reprinted from Dong's Blog
This article link address: http://dongxicheng.org/structure/structure-algorithm-summary/