ഫലകം:CS trees
|
|---|
Search trees
(dynamic sets/associative arrays) |
- 2–3
- 2–3–4
- AA
- (a,b)
- AVL
- B
- B+
- B*
- Bx
- (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
- 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
|
|---|