Data Structure Summary

1. Common Data Structures

Linear: array, linked list, queue, stack,Block array (array + linked list), Hash table, double-end queue

Tree:Heap (large and small heap),Trie tree (letter tree or dictionary tree), Suffix tree,Suffix tree Group, Binary sorting tree, binary balancing tree, B ++/B-, aVL,Treap, Red/black tree,Splay tree,Line Segment tree,Tree Array

Figure: Figure

Others:Query set, Rmq

2. Common Algorithms

(1) Basic Ideas: enumeration, recursion, sub-governance, simulation, greedy, dynamic planning, pruning, and backtracking

(2) graph algorithms: depth-first traversal and breadth-first traversal, shortest path, Minimum Spanning Tree, and Topology Sorting

(3) string algorithm: string SEARCH, hash algorithm, and KMP Algorithm

(4)Sorting Algorithm: Bubble, insert, select, fast sort, merge sort, Heap Sort, and bucket sort

(5) Dynamic Planning: knapsack problem, Longest Common subsequence, and optimal binary search tree

(6) Number Theory: prime number, integer, hexadecimal conversion, same-modulus operation,

(7) combination: Full Arrangement Algorithm and full combination algorithm

(8) Others:LCA and rmq Problems

Adding ......

 

Reposted from Dong's blog

Link:Http://dongxicheng.org/structure/structure-algorithm-summary/