C-trie
A C-trie is a compressed trie data structure. It achieves lower memory and query time requirements at the expense of reduced flexibility.
References
- Maly, K. Compressed tries. Commun. ACM 19, 7, 409–415. [1]
- v
- t
- e
Tree data structures
(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
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
