Radix Trie

Home > Computer Science > Algorithms and data structures > Tries > Radix Trie

A Radix Trie is a variation of a Trie that allows for strings to be stored in compressed form by sharing common prefixes. This reduces the overall storage requirements and also provides faster look-up times.