2013年（8）
分类： C/C++
2013-01-24 17:08:08
从上拷贝过来的，原来树结构有那么多种，未来的计划基本上就是过一遍
|
Trees in Computer Science |
|
|
Binary trees |
Binary search tree(BST), Cartesian tree, MVP tree, Top tree, T-tree |
|
Self-balancing binary search trees |
AA tree, AVL tree, LLRB tree, Red-block tree, Scapegoat tree, Splay tree, Treap |
|
B-trees |
B+ tree, B*-tree, Bx-tree, UB-tree, 2-3 tree, 2-3-4 tree, (a,b)-tree, Dancing tree, Htree |
|
Tries |
Suffix tree, Radix tree, Ternary search tree, X-fast trie, Y-fast trie |
|
Binary space partitioning(BSP) trees |
Quadtree, Octree, k-d tree, implicit k-d tree, VP tree |
|
Non-binary trees |
Exponential tree, Fusion tree, Interval tree, PQ tree, Range tree, SPQR tree, Van Emde Boas tree |
|
Spatial data partitioning trees |
R-tree, R+ tree, R* tree, M-tree, Segment tree, Hilbert R-tree, Priority R-tree |
|
Other trees |
Heap, Hash calendar, Hash tree, Finger tree, Order statistic tree, Metric tree, Cover tree, BK-tree, Doubly chained tree, iDistance, Link-cut tree, Fenwick tree |
