A C-trie is a compressed

trie In computer science, a trie, also called digital tree or prefix tree, is a type of ''k''-ary search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes def ...

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

Trees (data structures) {{algorithm-stub