Difference between revisions of "Template:CS trees"

From blackwiki
Jump to navigation Jump to search
(Why was BSP tree not listed? And a few heaps.)
(Removed "-tree" suffixes from everything.)
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<small><sup>x</sup></small>-tree]]
+
*[[Bx-tree|B<sup>x</sup>]]
*[[Binary search tree]]
+
*([[Optimal binary search tree|Optimal]])&nbsp;[[Binary search tree|Binary search]]
*[[Optimal binary search tree]]
+
*[[Dancing tree|Dancing]]
*[[Dancing tree]]
 
 
*[[HTree]]
 
*[[HTree]]
*[[Interval tree]]
+
*[[Interval tree|Interval]]
*[[Order statistic tree]]
+
*[[Order statistic tree|Order statistic]]
*[[Red–black tree]] ([[Left-leaning red–black tree|left-leaning]])
+
*([[Left-leaning red–black tree|Left-leaning]])&nbsp;[[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]]
  
 
|group4 = [[Trie]]s
 
|group4 = [[Trie]]s
 
|list4 =
 
|list4 =
*[[Hash tree (persistent data structure)|Hash tree]]
+
*[[Hash tree (persistent data structure)|Hash]]
*[[Radix tree]]
+
*[[Radix tree|Radix]]
*[[Suffix tree]]
+
*[[Suffix tree|Suffix]]
*[[Ternary search tree]]
+
*[[Ternary search tree|Ternary search]]
*[[X-fast trie]]
+
*[[X-fast trie|X-fast]]
*[[Y-fast trie]]
+
*[[Y-fast trie|Y-fast]]
  
 
|group2 = [[Heap (data structure)|Heaps]]
 
|group2 = [[Heap (data structure)|Heaps]]
Line 49: Line 48:
 
|group5  = [[Spatial index|Spatial]] data partitioning trees
 
|group5  = [[Spatial index|Spatial]] data partitioning trees
 
|list5  =  
 
|list5  =  
*[[BK-tree]]
+
*[[BK-tree|BK]]
*[[BSP tree]]
+
*[[BSP tree|BSP]]
*[[Cartesian tree]]
+
*[[Cartesian tree|Cartesian]]
*[[Hilbert R-tree]]
+
*[[Hilbert R-tree|Hilbert R]]
*[[k-d tree|''k''-d tree]] ([[Implicit k-d tree|implicit ''k''-d tree]])
+
*[[k-d tree|''k''-d]] ([[Implicit k-d tree|implicit ''k''-d]])
*[[M-tree]]
+
*[[M-tree|M]]
*[[Metric tree]]
+
*[[Metric tree|Metric]]
*[[MVP tree]]
+
*[[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 tree]]
+
*[[Vantage-point tree|VP]]
*[[X-tree]]
+
*[[X-tree|X]]
  
 
|group8 = Other trees
 
|group8 = Other trees
 
|list8  =  
 
|list8  =  
*[[Cover tree]]
+
*[[Cover tree|Cover]]
*[[Doubly chained tree]]
+
*[[Doubly chained tree|Doubly chained]]
*[[Exponential tree]]
+
*[[Exponential tree|Exponential]]
*[[Fenwick tree]]
+
*[[Fenwick tree|Fenwick]]
*[[Finger tree]]
+
*[[Finger tree|Finger]]
*[[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 templates]]
 
[[Category:Computer science templates]]
 
</noinclude>
 
</noinclude>

Revision as of 08:55, 18 January 2015