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
A C-trie is a compressed trie data structure. It achieves lower memory and query time requirements at the expense of reduced flexibility.
| Search trees (dynamic sets, associative arrays) | |
|---|---|
| Heaps | |
| Tries | |
| Spatial data partitioning trees | |
| Other trees | |