Difference between revisions of "Template:CS trees"
Jump to navigation
Jump to search
(Not notable, not standard terminology.) |
imported>HueSatLum m (MOS:DASH) |
||
| (16 intermediate revisions by 8 users not shown) | |||
| Line 6: | Line 6: | ||
|group1 = [[Search tree]]s<br/>([[set (abstract data type)|dynamic set]]s/[[associative array]]s) | |group1 = [[Search tree]]s<br/>([[set (abstract data type)|dynamic set]]s/[[associative array]]s) | ||
|list1 = | |list1 = | ||
| − | *[[2–3 tree]] | + | *[[2–3 tree|2–3]] |
| − | *[[2–3–4 tree]] | + | *[[2–3–4 tree|2–3–4]] |
| − | *[[AA tree]] | + | *[[AA tree|AA]] |
| − | *[[(a,b)-tree]] | + | *[[(a,b)-tree|(a,b)]] |
| − | *[[AVL tree]] | + | *[[AVL tree|AVL]] |
| − | *[[B-tree]] | + | *[[B-tree|B]] |
| − | *[[B+ tree]] | + | *[[B+ tree|B+]] |
| − | *[[B*-tree]] | + | *[[B*-tree|B*]] |
| − | *[[Bx-tree|B | + | *[[Bx-tree|B<sup>x</sup>]] |
| − | *[[ | + | *([[Optimal binary search tree|Optimal]]) [[Binary search tree|Binary search]] |
| − | + | *[[Dancing tree|Dancing]] | |
| − | *[[Dancing tree]] | ||
*[[HTree]] | *[[HTree]] | ||
| − | *[[Interval tree]] | + | *[[Interval tree|Interval]] |
| − | *[[Order statistic tree]] | + | *[[Order statistic tree|Order statistic]] |
| − | * | + | *([[Left-leaning red–black tree|Left-leaning]]) [[Red–black tree|Red–black]] |
| − | *[[Scapegoat tree]] | + | *[[Scapegoat tree|Scapegoat]] |
| − | *[[Splay tree]] | + | *[[Splay tree|Splay]] |
| − | *[[T-tree]] | + | *[[T-tree|T]] |
*[[Treap]] | *[[Treap]] | ||
| − | *[[UB-tree]] | + | *[[UB-tree|UB]] |
| + | *[[Weight-balanced tree|Weight-balanced]] | ||
|group4 = [[Trie]]s | |group4 = [[Trie]]s | ||
|list4 = | |list4 = | ||
| − | *[[Hash tree (persistent data structure)|Hash | + | *[[Ctrie]] |
| − | *[[Radix tree]] | + | *[[C-trie|C-trie (compressed ADT)]] |
| − | *[[Suffix tree]] | + | *[[Hash tree (persistent data structure)|Hash]] |
| − | *[[Ternary search tree]] | + | *[[Radix tree|Radix]] |
| − | *[[X-fast trie]] | + | *[[Suffix tree|Suffix]] |
| − | *[[Y-fast trie]] | + | *[[Ternary search tree|Ternary search]] |
| + | *[[X-fast trie|X-fast]] | ||
| + | *[[Y-fast trie|Y-fast]] | ||
|group2 = [[Heap (data structure)|Heaps]] | |group2 = [[Heap (data structure)|Heaps]] | ||
|list2 = | |list2 = | ||
| − | *[[Binary heap]] | + | *[[Binary heap|Binary]] |
| − | *[[Leftist tree|Leftist heap]] | + | *[[Binomial heap|Binomial]] |
| − | *[[Skew heap]] | + | *[[Brodal queue|Brodal]] |
| − | *[[Van Emde Boas tree]] | + | *[[Fibonacci heap|Fibonacci]] |
| + | *[[Leftist tree|Leftist]] | ||
| + | *[[Pairing heap|Pairing]] | ||
| + | *[[Skew heap|Skew]] | ||
| + | *[[Van Emde Boas tree|van Emde Boas]] | ||
| + | *[[Weak heap|Weak]] | ||
|group5 = [[Spatial index|Spatial]] data partitioning trees | |group5 = [[Spatial index|Spatial]] data partitioning trees | ||
|list5 = | |list5 = | ||
| − | *[[BK-tree]] | + | *[[Ball tree|Ball]] |
| − | *[[Cartesian tree]] | + | *[[BK-tree|BK]] |
| − | *[[Hilbert R-tree]] | + | *[[BSP tree|BSP]] |
| − | *[[k-d tree|''k''-d | + | *[[Cartesian tree|Cartesian]] |
| − | *[[M-tree]] | + | *[[Hilbert R-tree|Hilbert R]] |
| − | *[[Metric tree]] | + | *[[k-d tree|''k''-d]] ([[Implicit k-d tree|implicit ''k''-d]]) |
| − | *[[MVP tree]] | + | *[[M-tree|M]] |
| + | *[[Metric tree|Metric]] | ||
| + | *[[MVP tree|MVP]] | ||
*[[Octree]] | *[[Octree]] | ||
| − | *[[Priority R-tree]] | + | *[[Priority R-tree|Priority R]] |
| − | *[[Quadtree]] | + | *[[Quadtree|Quad]] |
| − | *[[R-tree]] | + | *[[R-tree|R]] |
| − | *[[R+ tree]] | + | *[[R+ tree|R+]] |
| − | *[[R* tree]] | + | *[[R* tree|R*]] |
| − | *[[Segment tree]] | + | *[[Segment tree|Segment]] |
| − | *[[Vantage-point tree|VP | + | *[[Vantage-point tree|VP]] |
| − | *[[X-tree]] | + | *[[X-tree|X]] |
|group8 = Other trees | |group8 = Other trees | ||
|list8 = | |list8 = | ||
| − | *[[Cover tree]] | + | *[[Cover tree|Cover]] |
| − | *[[ | + | *[[Exponential tree|Exponential]] |
| − | *[[ | + | *[[Fenwick tree|Fenwick]] |
| − | *[[ | + | *[[Finger tree|Finger]] |
| − | *[[ | + | *[[Fractal tree index|Fractal tree index]] |
| − | *[[Fusion tree]] | + | *[[Fusion tree|Fusion]] |
*[[Hash calendar]] | *[[Hash calendar]] | ||
*[[iDistance]] | *[[iDistance]] | ||
| − | *[[K-ary tree]] | + | *[[K-ary tree|K-ary]] |
| − | *[[Left-child right-sibling binary tree]] | + | *[[Left-child right-sibling binary tree|Left-child right-sibling]] |
| − | *[[Link/cut tree]] | + | *[[Link/cut tree|Link/cut]] |
| − | *[[Log-structured merge-tree]] | + | *[[Log-structured merge-tree|Log-structured merge]] |
| − | *[[Merkle tree]] | + | *[[Merkle tree|Merkle]] |
| − | *[[PQ tree]] | + | *[[PQ tree|PQ]] |
| − | *[[Range tree]] | + | *[[Range tree|Range]] |
| − | *[[SPQR tree]] | + | *[[SPQR tree|SPQR]] |
| − | *[[Top tree]] | + | *[[Top tree|Top]] |
}}<noinclude> | }}<noinclude> | ||
| − | [[Category:Computer science | + | {{doc|content= |
| + | {{NODOC}} | ||
| + | |||
| + | [[Category:Computer science navigational boxes]] | ||
| + | }} | ||
</noinclude> | </noinclude> | ||
Latest revision as of 01:24, 18 September 2020
| Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages. Subpages of this template. |