Noun
radix tree (plural radix trees) (computing theory) A space-optimized trie data structure in which each node that is the only child is merged with its parent.