Editing List of data structures (section)

== Trees ==
{{Main|Tree (data structure)}}
Trees are a subset of [[directed acyclic graph]]s.

=== Binary trees ===
*[[AA tree]]
*[[AVL tree]]
*[[Binary search tree]]
*[[Binary tree]]
*[[Cartesian tree]]
*[[Conc-tree list]]
*[[Left-child right-sibling binary tree]]
*[[Order statistic tree]]
*[[Pagoda (data structure)|Pagoda]]
*[[Randomized binary search tree]]
*[[Red–black tree]]
*[[Rope (computer science)|Rope]]
*[[Scapegoat tree]]
*[[Self-balancing binary search tree]]
*[[Splay tree]]
*[[T-tree]]
*[[Tango tree]]
*[[Threaded binary tree]]
*[[Top tree]]
*[[Treap]]
*[[WAVL tree]]
*[[Weight-balanced tree]]
*[[Zip tree]]

=== B-trees ===
*[[B-tree]]
*[[B+ tree]]
*[[B*-tree]]
*[[Dancing tree]]
*[[2–3 tree]]
*[[2–3–4 tree]]
*[[Queap]]
*[[Fusion tree]]
*[[Bx-tree Moving Object Index|Bx-tree]]

=== Heaps ===
*[[Heap (data structure)|Heap]]
*[[Min-max heap]]
*[[Binary heap]]
*[[B-heap]]
*[[Weak heap]]
*[[Binomial heap]]
*[[Fibonacci heap]]
*[[AF-heap]]
*[[Smoothsort|Leonardo heap]]
*[[2–3 heap]]
*[[Soft heap]]
*[[Pairing heap]]
*[[Leftist tree|Leftist heap]]
*[[Treap]]
*[[Beap]]
*[[Skew heap]]
*[[Ternary heap]]
*[[D-ary heap]]
*[[Brodal queue]]

=== Bit-slice trees ===
In these data structures each tree node compares a bit slice of key values.
*[[Radix tree]]
*[[Suffix tree]]
*[[Suffix array]]
*[[Compressed suffix array]]
*[[FM-index]]
*[[Generalised suffix tree]]
*[[B-tree]]
*[[Judy array]]
*[[Trie]]
*[[X-fast trie]]
*[[Y-fast trie]]
*[[Merkle tree]]

=== Multi-way trees ===
*[[Ternary search tree]]
*[[Ternary tree]]
*[[K-ary tree]]
*[[And–or tree]]
*[[(a,b)-tree]]
*[[Link/cut tree]]
*[[SPQR-tree]]
*[[Spaghetti stack]]
*[[Disjoint-set data structure|Disjoint-set data structure (Union-find data structure)]]
*[[Fusion tree]]
*[[Enfilade (Xanadu)|Enfilade]]
*[[Exponential tree]]
*[[Fenwick tree]]
*[[Van Emde Boas tree]]
*[[Rose tree]]

=== Space-partitioning trees ===
These are data structures used for [[space partitioning]] or [[binary space partitioning]].
*[[Segment tree]]
*[[Interval tree]]
*[[Range tree]]
*[[Bin (computational geometry)|Bin]]
*[[K-d tree]]
*[[Implicit k-d tree]]
*[[Min/max kd-tree|Min/max k-d tree]]
*[[Relaxed k-d tree]]
*[[Adaptive k-d tree]]
*[[Quadtree]]
*[[Octree]]
*[[Linear octree]]
*[[Z-order (curve)|Z-order]]
*[[UB-tree]]
*[[R-tree]]
*[[R+ tree]]
*[[R* tree]]
*[[Hilbert R-tree]]
*[[X-tree]]
*[[Metric tree]]
*[[Cover tree]]
*[[M-tree]]
*[[VP-tree]]
*[[BK-tree]]
*[[Bounding interval hierarchy]]
*[[Bounding volume hierarchy]]
*[[BSP tree]]
*[[Rapidly exploring random tree]]

=== Application-specific trees ===
*[[Abstract syntax tree]]
*[[Parse tree]]
*[[Decision tree]]
*[[Alternating decision tree]]
*[[Minimax tree]]
*[[Expectiminimax tree]]
*[[Finger tree]]
*[[Expression tree]]
*[[Log-structured merge-tree]]
*[[PQ tree]]