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>HueSatLum m (MOS:DASH) |
||
| (24 intermediate revisions by 13 users not shown) | |||
| Line 4: | Line 4: | ||
|listclass=hlist | |listclass=hlist | ||
| − | |group1 = [[ | + | |group1 = [[Search tree]]s<br/>([[set (abstract data type)|dynamic set]]s/[[associative array]]s) |
|list1 = | |list1 = | ||
| − | *[[ | + | *[[2–3 tree|2–3]] |
| − | *[[ | + | *[[2–3–4 tree|2–3–4]] |
| − | *[[ | + | *[[AA tree|AA]] |
| − | *[[ | + | *[[(a,b)-tree|(a,b)]] |
| − | *[[ | + | *[[AVL tree|AVL]] |
| − | *[[ | + | *[[B-tree|B]] |
| − | + | *[[B+ tree|B+]] | |
| − | | | + | *[[B*-tree|B*]] |
| − | | | + | *[[Bx-tree|B<sup>x</sup>]] |
| − | *[[ | + | *([[Optimal binary search tree|Optimal]]) [[Binary search tree|Binary search]] |
| − | *[[ | + | *[[Dancing tree|Dancing]] |
| − | *[[Left-leaning red–black tree| | + | *[[HTree]] |
| − | *[[ | + | *[[Interval tree|Interval]] |
| − | *[[ | + | *[[Order statistic tree|Order statistic]] |
| − | *[[ | + | *([[Left-leaning red–black tree|Left-leaning]]) [[Red–black tree|Red–black]] |
| + | *[[Scapegoat tree|Scapegoat]] | ||
| + | *[[Splay tree|Splay]] | ||
| + | *[[T-tree|T]] | ||
*[[Treap]] | *[[Treap]] | ||
| − | + | *[[UB-tree|UB]] | |
| − | + | *[[Weight-balanced tree|Weight-balanced]] | |
| − | | | ||
| − | |||
| − | |||
| − | *[[ | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|group4 = [[Trie]]s | |group4 = [[Trie]]s | ||
|list4 = | |list4 = | ||
| − | *[[ | + | *[[Ctrie]] |
| − | *[[ | + | *[[C-trie|C-trie (compressed ADT)]] |
| − | *[[Hash tree (persistent data structure)|Hash 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]] | ||
| − | |group5 = [[ | + | |group2 = [[Heap (data structure)|Heaps]] |
| + | |list2 = | ||
| + | *[[Binary heap|Binary]] | ||
| + | *[[Binomial heap|Binomial]] | ||
| + | *[[Brodal queue|Brodal]] | ||
| + | *[[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 | ||
|list5 = | |list5 = | ||
| − | *[[ | + | *[[Ball tree|Ball]] |
| + | *[[BK-tree|BK]] | ||
| + | *[[BSP tree|BSP]] | ||
| + | *[[Cartesian tree|Cartesian]] | ||
| + | *[[Hilbert R-tree|Hilbert R]] | ||
| + | *[[k-d tree|''k''-d]] ([[Implicit k-d tree|implicit ''k''-d]]) | ||
| + | *[[M-tree|M]] | ||
| + | *[[Metric tree|Metric]] | ||
| + | *[[MVP tree|MVP]] | ||
*[[Octree]] | *[[Octree]] | ||
| − | *[[ | + | *[[Priority R-tree|Priority R]] |
| − | *[[ | + | *[[Quadtree|Quad]] |
| − | *[[ | + | *[[R-tree|R]] |
| − | + | *[[R+ tree|R+]] | |
| − | + | *[[R* tree|R*]] | |
| − | + | *[[Segment tree|Segment]] | |
| − | *[[ | + | *[[Vantage-point tree|VP]] |
| − | + | *[[X-tree|X]] | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | | | ||
| − | |||
| − | |||
| − | *[[R* tree | ||
| − | * | ||
| − | *[[ | ||
| − | |||
| − | *[[ | ||
| − | *[[ | ||
|group8 = Other trees | |group8 = Other trees | ||
|list8 = | |list8 = | ||
| − | *[[ | + | *[[Cover tree|Cover]] |
| + | *[[Exponential tree|Exponential]] | ||
| + | *[[Fenwick tree|Fenwick]] | ||
| + | *[[Finger tree|Finger]] | ||
| + | *[[Fractal tree index|Fractal tree index]] | ||
| + | *[[Fusion tree|Fusion]] | ||
*[[Hash calendar]] | *[[Hash calendar]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
*[[iDistance]] | *[[iDistance]] | ||
| − | *[[ | + | *[[K-ary tree|K-ary]] |
| − | *[[ | + | *[[Left-child right-sibling binary tree|Left-child right-sibling]] |
| − | *[[Log-structured merge-tree]] | + | *[[Link/cut tree|Link/cut]] |
| + | *[[Log-structured merge-tree|Log-structured merge]] | ||
| + | *[[Merkle tree|Merkle]] | ||
| + | *[[PQ tree|PQ]] | ||
| + | *[[Range tree|Range]] | ||
| + | *[[SPQR tree|SPQR]] | ||
| + | *[[Top tree|Top]] | ||
| + | }}<noinclude> | ||
| + | {{doc|content= | ||
| + | {{NODOC}} | ||
| − | + | [[Category:Computer science navigational boxes]] | |
| − | [[Category:Computer science | + | }} |
</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. |