Template:CS trees: Difference between revisions

Latest revision as of 12:00, 12 July 2023

Template documentation

This template is used to show pages to do with computer science data trees.

[[Category:Template documentation pages{{#translation:}}]]

v t e Tree data structures
Search trees (dynamic sets/associative arrays)	2–3 2–3–4 AA (a,b) AVL B B+ B* B^x (Optimal) Binary search Dancing HTree Interval Order statistic (Left-leaning) Red–black Scapegoat Splay T Treap UB Weight-balanced
Heaps	Binary Binomial Brodal Fibonacci Leftist Pairing Skew van Emde Boas Weak
Tries	Ctrie C-trie (compressed ADT) Hash Radix Suffix Ternary search X-fast Y-fast
Spatial data partitioning trees	Ball BK BSP Cartesian Hilbert R k-d (implicit k-d) M Metric MVP Octree PH Priority R Quad R R+ R* Segment VP X
Other trees	Cover Exponential Fenwick Finger Fractal tree index Fusion Hash calendar iDistance K-ary Left-child right-sibling Link/cut Log-structured merge Merkle PQ Range SPQR Top

Revision as of 19:14, 16 February 2023 (view source) alpha>Indicwiki (Created page with "{{Navbox \|name = CS trees \|title = Tree data structures \|listclass=hlist \|group1 = Search trees<br/>(set (abstract data type)\|dynamic se...")	Latest revision as of 12:00, 12 July 2023 (view source) Indicwiki (talk \| contribs) m (1 revision imported from alpha:Template:CS_trees)
(No difference)