Difference between revisions of "Template:CS trees"

From blackwiki
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  = [[Binary tree]]s
+
|group1  = [[Search tree]]s ([[dynamic set]]s/[[associative array]]s)
 
|list1  =  
 
|list1  =  
*[[Binary search tree|Binary search tree (BST)]]
+
*[[2–3 tree]]
*[[Cartesian tree]]
+
*[[2–3–4 tree]]
*[[MVP tree]]
 
*[[Top tree]]
 
*[[T-tree]]
 
*[[Left-child right-sibling binary tree]]
 
 
 
|group2 = [[Self-balancing binary search tree]]s
 
|list2 =
 
 
*[[AA tree]]
 
*[[AA tree]]
 +
*[[(a,b)-tree]]
 
*[[AVL tree]]
 
*[[AVL tree]]
*[[Left-leaning red–black tree|LLRB tree]]
+
*[[B-tree]]
*[[Red–black tree]]
 
*[[Scapegoat tree]]
 
*[[Splay tree]]
 
*[[Treap]]
 
 
 
|group3 = [[B-tree]]s
 
|list3 =
 
 
*[[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]]
*[[UB-tree]]
+
*[[Binary search tree]]
*[[2–3 tree]]
 
*[[2–3–4 tree]]
 
*[[(a,b)-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  = [[Binary space partitioning|Binary space partitioning (BSP)]] trees
+
|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]]
*[[Octree]]
 
*[[k-d tree|''k''-d tree]]
 
*[[Implicit k-d tree|Implicit ''k''-d tree]]
 
*[[Vantage-point tree|VP tree]]
 
 
|group6 = Non-binary trees
 
|list6 =
 
*[[K-ary tree]]
 
*[[Exponential tree]]
 
*[[Fusion tree]]
 
*[[Interval tree]]
 
*[[PQ tree]]
 
*[[Range tree]]
 
*[[SPQR tree]]
 
*[[Van Emde Boas tree]]
 
 
|group7 = [[Spatial index|Spatial]] data partitioning trees
 
|list7 =
 
 
*[[R-tree]]
 
*[[R-tree]]
 
*[[R+ tree]]
 
*[[R+ tree]]
 
*[[R* tree]]
 
*[[R* tree]]
 +
*[[Segment tree]]
 +
*[[Vantage-point tree|VP tree]]
 
*[[X-tree]]
 
*[[X-tree]]
*[[M-tree]]
 
*[[Segment tree]]
 
*[[Hilbert R-tree]]
 
*[[Priority R-tree]]
 
  
 
|group8 = Other trees
 
|group8 = Other trees
 
|list8  =  
 
|list8  =  
*[[Heap (data structure)|Heap]]
 
 
*[[Hash calendar]]
 
*[[Hash calendar]]
 
*[[Merkle tree]]
 
*[[Merkle tree]]
 
*[[Finger tree]]
 
*[[Finger tree]]
*[[Order statistic tree]]
 
*[[Metric tree]]
 
 
*[[Cover tree]]
 
*[[Cover tree]]
*[[BK-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>

Revision as of 15:59, 13 April 2014