abstract:In computer science, a radix tree (also patricia trie or radix trie or compact prefix tree) is a space-optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has up to the number of children of the radix r of the radix trie, where r is a positive integer, where r is a power x of 2, and where x ≥ 1.