Difference between revisions of "Template:CS trees"
Jump to navigation
Jump to search
imported>Scire9 m (Added K-ary Trees (also known as N-ary Trees)) |
imported>Qwertyus (re-categorize by use case, as suggested on talk page) |
||
| Line 4: | Line 4: | ||
|listclass=hlist | |listclass=hlist | ||
| − | |group1 = [[ | + | |group1 = [[Search tree]]s ([[dynamic set]]s/[[associative array]]s) |
|list1 = | |list1 = | ||
| − | *[[ | + | *[[2–3 tree]] |
| − | + | *[[2–3–4 tree]] | |
| − | *[[ | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
*[[AA tree]] | *[[AA tree]] | ||
| + | *[[(a,b)-tree]] | ||
*[[AVL tree]] | *[[AVL tree]] | ||
| − | * | + | *[[B-tree]] |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
*[[B+ tree]] | *[[B+ tree]] | ||
*[[B*-tree]] | *[[B*-tree]] | ||
*[[Bx-tree|B<small><sup>x</sup></small>-tree]] | *[[Bx-tree|B<small><sup>x</sup></small>-tree]] | ||
| − | *[[ | + | *[[Binary search tree]] |
| − | |||
| − | |||
| − | |||
*[[Dancing tree]] | *[[Dancing tree]] | ||
*[[HTree]] | *[[HTree]] | ||
| + | *[[Interval tree]] | ||
| + | *[[Order statistic tree]] | ||
| + | *[[Red–black tree]] ([[Left-leaning red–black tree|left-leaning]]) | ||
| + | *[[Scapegoat tree]] | ||
| + | *[[Splay tree]] | ||
| + | *[[T-tree]] | ||
| + | *[[Treap]] | ||
| + | *[[UB-tree]] | ||
|group4 = [[Trie]]s | |group4 = [[Trie]]s | ||
| Line 44: | Line 36: | ||
*[[Y-fast trie]] | *[[Y-fast trie]] | ||
| − | |group5 = [[ | + | |group2 = [[Heap (data structure)|Heaps]] |
| + | |list2 = | ||
| + | *[[Binary heap]] | ||
| + | *[[Leftist heap]] | ||
| + | *[[Skew heap]] | ||
| + | *[[Van Emde Boas tree]] | ||
| + | |||
| + | |group5 = [[Spatial index|Spatial]] data partitioning trees | ||
|list5 = | |list5 = | ||
| + | *[[BK-tree]] | ||
| + | *[[Cartesian tree]] | ||
| + | *[[Hilbert R-tree]] | ||
| + | *[[k-d tree|''k''-d tree]] ([[Implicit k-d tree|implicit ''k''-d tree]]) | ||
| + | *[[M-tree]] | ||
| + | *[[Metric tree]] | ||
| + | *[[MVP tree]] | ||
| + | *[[Octree]] | ||
| + | *[[Priority R-tree]] | ||
*[[Quadtree]] | *[[Quadtree]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
*[[R-tree]] | *[[R-tree]] | ||
*[[R+ tree]] | *[[R+ tree]] | ||
*[[R* tree]] | *[[R* tree]] | ||
| + | *[[Segment tree]] | ||
| + | *[[Vantage-point tree|VP tree]] | ||
*[[X-tree]] | *[[X-tree]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
|group8 = Other trees | |group8 = Other trees | ||
|list8 = | |list8 = | ||
| − | |||
*[[Hash calendar]] | *[[Hash calendar]] | ||
*[[Merkle tree]] | *[[Merkle tree]] | ||
*[[Finger tree]] | *[[Finger tree]] | ||
| − | |||
| − | |||
*[[Cover tree]] | *[[Cover tree]] | ||
| − | |||
*[[Doubly chained tree]] | *[[Doubly chained tree]] | ||
*[[iDistance]] | *[[iDistance]] | ||
| Line 89: | Line 73: | ||
*[[Fenwick tree]] | *[[Fenwick tree]] | ||
*[[Log-structured merge-tree]] | *[[Log-structured merge-tree]] | ||
| − | + | *[[Top tree]] | |
| + | *[[Left-child right-sibling binary tree]] | ||
| + | *[[K-ary tree]] | ||
| + | *[[Exponential tree]] | ||
| + | *[[Fusion tree]] | ||
| + | *[[PQ tree]] | ||
| + | *[[Range tree]] | ||
| + | *[[SPQR tree]] | ||
}}<noinclude> | }}<noinclude> | ||
[[Category:Computer science templates]] | [[Category:Computer science templates]] | ||
</noinclude> | </noinclude> | ||