Template:CS trees
{{Navbox
|name = CS trees
|title = Tree data structures
|listclass=hlist
|group1 = Search trees
(dynamic sets,
associative arrays)
|list1 =
- 2–3
- 2–3–4
- AA
- (a,b)
- AVL
- B
- K-Dimensional
- B+
- B*
- Bx
- Binary search
- Optimal
- Self-balancing
- Dancing
- HTree
- Interval
- Order statistic
- Palindrome
- (Left-leaning) Red–black
- Scapegoat
- Splay
- T
- Treap
- UB
- Weight-balanced
|group2 = Heaps
|list2 =
|group3 = Tries
|list3 =
|group4 = Spatial data
partitioning trees
|list4 =
- 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
|group5 = Other trees
|list5 =
- Cover
- Exponential
- Fenwick
- Finger
- Fractal index
- Fusion
- Hash calendar
- iDistance
- K-ary
- Left-child right-sibling
- Link/cut
- Log-structured merge
- Merkle
- PQ
- Range
- SPQR
- Top
}}
{{Navbox documentation}}
This template is used to show pages involving computer science data trees.