AVL tree
After traversing ago
Tree traversal depth and breadth
FIG tree is a special
FIG connections belonging to the data structure;
Disjoint-set
Minimum spanning tree
union find
FIG traversal by normal breadth can do, but the speed is low;
Disjoint-set can be reduced to logn
Data is small, you can use a two-dimensional array
1 know that, do not know is 0
Then recursively, do a deep traversal
Dynamic Programming
NP problem
A list, any number, find the greatest and continuous.
This question is the essence of previous and less than 0 would not have a plus.
Obtain the current optimal solution at each point recorded.
So do not go and beg before the.
how are you
Convert more factors into fewer factors;
Internet page article score it?