https://www.vigyanwiki.in/index.php?action=history&feed=atom&title=Template%3ACS_trees 2026-06-15T11:46:23Z Revision history for this page on the wiki MediaWiki 1.39.3 https://www.vigyanwiki.in/index.php?title=Template:CS_trees&diff=213342&oldid=prev 2023-07-12T06:30:46Z

<p>1 revision imported from <a href="https://alpha.indicwiki.in/index.php?title=Template:CS_trees" class="extiw" title="alpha:Template:CS trees">alpha:Template:CS_trees</a></p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <tr class="diff-title" lang="en-GB"> <td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 12:00, 12 July 2023</td> </tr><tr><td colspan="2" class="diff-notice" lang="en-GB"><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Indicwiki https://www.vigyanwiki.in/index.php?title=Template:CS_trees&diff=213341&oldid=prev 2023-02-16T13:44:33Z

<p>Created page with &quot;{{Navbox |name = CS trees |title = <a href="/index.php?title=Tree_(data_structure)&amp;action=edit&amp;redlink=1" class="new" title="Tree (data structure) (page does not exist)">Tree data structures</a> |listclass=hlist |group1 = <a href="/index.php?title=Search_tree&amp;action=edit&amp;redlink=1" class="new" title="Search tree (page does not exist)">Search trees</a>&lt;br/&gt;(set (abstract data type)|dynamic se...&quot;</p> <p><b>New page</b></p><div>{{Navbox<br /> |name = CS trees<br /> |title = [[Tree (data structure)|Tree data structures]]<br /> |listclass=hlist<br /> <br /> |group1 = [[Search tree]]s&lt;br/&gt;([[set (abstract data type)|dynamic set]]s/[[associative array]]s)<br /> |list1 = <br /> *[[2–3 tree|2–3]]<br /> *[[2–3–4 tree|2–3–4]]<br /> *[[AA tree|AA]]<br /> *[[(a,b)-tree|(a,b)]]<br /> *[[AVL tree|AVL]]<br /> *[[B-tree|B]]<br /> *[[B+ tree|B+]]<br /> *[[B*-tree|B*]]<br /> *[[Bx-tree|B&lt;sup&gt;x&lt;/sup&gt;]]<br /> *([[Optimal binary search tree|Optimal]])&amp;nbsp;[[Binary search tree|Binary search]]<br /> *[[Dancing tree|Dancing]]<br /> *[[HTree]]<br /> *[[Interval tree|Interval]]<br /> *[[Order statistic tree|Order statistic]]<br /> *([[Left-leaning red–black tree|Left-leaning]])&amp;nbsp;[[Red–black tree|Red–black]]<br /> *[[Scapegoat tree|Scapegoat]]<br /> *[[Splay tree|Splay]]<br /> *[[T-tree|T]]<br /> *[[Treap]]<br /> *[[UB-tree|UB]]<br /> *[[Weight-balanced tree|Weight-balanced]]<br /> <br /> |group4 = [[Trie]]s<br /> |list4 =<br /> *[[Ctrie]]<br /> *[[C-trie|C-trie (compressed ADT)]]<br /> *[[Hash tree (persistent data structure)|Hash]]<br /> *[[Radix tree|Radix]]<br /> *[[Suffix tree|Suffix]]<br /> *[[Ternary search tree|Ternary search]]<br /> *[[X-fast trie|X-fast]]<br /> *[[Y-fast trie|Y-fast]]<br /> <br /> |group2 = [[Heap (data structure)|Heaps]]<br /> |list2 =<br /> *[[Binary heap|Binary]]<br /> *[[Binomial heap|Binomial]]<br /> *[[Brodal queue|Brodal]]<br /> *[[Fibonacci heap|Fibonacci]]<br /> *[[Leftist tree|Leftist]]<br /> *[[Pairing heap|Pairing]]<br /> *[[Skew heap|Skew]]<br /> *[[Van Emde Boas tree|van Emde Boas]]<br /> *[[Weak heap|Weak]]<br /> <br /> |group5 = [[Spatial index|Spatial]] data partitioning trees<br /> |list5 = <br /> *[[Ball tree|Ball]]<br /> *[[BK-tree|BK]]<br /> *[[BSP tree|BSP]]<br /> *[[Cartesian tree|Cartesian]]<br /> *[[Hilbert R-tree|Hilbert R]]<br /> *[[k-d tree|''k''-d]] ([[Implicit k-d tree|implicit ''k''-d]])<br /> *[[M-tree|M]]<br /> *[[Metric tree|Metric]]<br /> *[[MVP tree|MVP]]<br /> *[[Octree]]<br /> *[[PH-tree|PH]]<br /> *[[Priority R-tree|Priority R]]<br /> *[[Quadtree|Quad]]<br /> *[[R-tree|R]]<br /> *[[R+ tree|R+]]<br /> *[[R* tree|R*]]<br /> *[[Segment tree|Segment]]<br /> *[[Vantage-point tree|VP]]<br /> *[[X-tree|X]]<br /> <br /> |group8 = Other trees<br /> |list8 = <br /> *[[Cover tree|Cover]]<br /> *[[Exponential tree|Exponential]]<br /> *[[Fenwick tree|Fenwick]]<br /> *[[Finger tree|Finger]]<br /> *[[Fractal tree index|Fractal tree index]]<br /> *[[Fusion tree|Fusion]]<br /> *[[Hash calendar]]<br /> *[[iDistance]]<br /> *[[K-ary tree|K-ary]]<br /> *[[Left-child right-sibling binary tree|Left-child right-sibling]]<br /> *[[Link/cut tree|Link/cut]]<br /> *[[Log-structured merge-tree|Log-structured merge]]<br /> *[[Merkle tree|Merkle]]<br /> *[[PQ tree|PQ]]<br /> *[[Range tree|Range]]<br /> *[[SPQR tree|SPQR]]<br /> *[[Top tree|Top]]<br /> <br /> }}&lt;noinclude&gt;<br /> {{doc|content=<br /> This template is used to show pages to do with computer science data trees.<br /> <br /> [[Category:Computer science navigational boxes]]<br /> }}<br /> &lt;/noinclude&gt;</div>

alpha>Indicwiki