Explore relationships

Radix tree

In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimizedtrie (prefix tree) in which each node that is the only child is merged with its parent.

Use + to expand a branch. Click a topic name to open its summary.