Data Structures

-!5. TrieSuffix Tree: http://blog.csdn.net/v_july_v/article/details/6897097

　　Trie: think about how you used King Dict by typing; Suffix Tree: all suffix on a trie.
　　*Suffix Tree construction: Ukkonen Algorithm(http://stackoverflow.com/questions/9452701/ukkonens-suffix-tree-algorithm-in-plain-english); Growthing by splitting dynamically. Suffix Array: http://blog.csdn.net/zdl1016/article/details/4731875. Sorting lexicographically is the key.

-6. Segment Tree.Cut in half until only one number

9. Advanced data structures

    Union-Set (http://dongxicheng.org/structure/union-find-set/ Simply trees with parent ptr)
　　　　2 optimizations: http://www.cnblogs.com/wuchanming/p/3873847.html
　　　　union by rank: append smaller set under larger set. to avoid degeneration to list
     　　path compression: all sub-nodes pointing to root
    Skip list (multi-level list, actually a BST i think)
    Tournament Tree: complete binary tree. EPI p425. Beautiful explanation.(like a binary indexed tree?)
    Dancing list! - exact cover problem.  http://blog.csdn.net/sunny606/article/details/7833551
　　　　　　　　　　　　　　　　　　　　http://www.cnblogs.com/steady/archive/2011/03/15/1984791.html (advanced)
　　　　essentially a dynamic optimization in terms of sparse matrix like structures.
    Leftist heap: make right child sub-heap short. For faster heap merge.
　　　　http://www.xuebuyuan.com/159395.html
    *Binomial Heap: recurrent forest. Generalized to Fibonacci Heap. Only theoretical value.
    Min-Max Heap: http://wenku.baidu.com/view/1951fecdda38376baf1fae37. Min-Heap & Max-Heap interleaved.
    Rope: http://www.ibm.com/developerworks/cn/java/j-ropes/index.html. Tree structured string.
    Finger tree
　 Patricia Tree

    Binary Indexed Tree: http://baike.baidu.com/view/1420784.htm
　　　　Related with segment tree. similar like skip-list, but indexed by (partial) sums - log(n) to compute sum - for statistics
    *Splay tree: http://www.cnblogs.com/vamei/archive/2013/03/24/2976545.html
　　　　complex as RB-tree. Query oriented; floating up queried node to root & balancing every query, by rotations as RB-tree.
    Treap: http://www.cnblogs.com/shuaiwhu/archive/2012/05/06/2485894.html
　　　　BST & Heap mixed: left ight: BST; parentchild: Heap