A C-trie is a compressed

trie In computer science, a trie (, ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings from a dictionary or set. Unlike a binary search tree, nodes in a trie do not store t ...

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