Radix trees are useful for constructing associative arrays with keys that can be expressed as strings. They find particular application in the … See more

The datastructure was invented in 1968 by Donald R. Morrison, with whom it is primarily associated, and by Gernot Gwehenberger.
Donald Knuth, … See more

A common extension of radix trees uses two colors of nodes, 'black' and 'white'. To check if a given string is stored in the tree, the search starts from the top and follows the edges of the input string until no further progress can be made. If the search string is … See more

• Algorithms and Data Structures Research & Reference Material: PATRICIA, by Lloyd Allison, Monash University
• Patricia Tree, NIST Dictionary of Algorithms and Data Structures
• See more

Radix trees support insertion, deletion, and searching operations. Insertion adds a new string to the trie while trying to minimize the amount of data stored. Deletion removes a … See more

(In the following comparisons, it is assumed that the keys are of length k and the data structure contains n members.)
Unlike balanced trees, radix trees permit lookup, insertion, and deletion in O(k) time rather than O(log n). This does not seem like an advantage, … See more

• Computer programming portal
• Prefix tree (also known as a Trie)
• Deterministic acyclic finite state automaton (DAFSA)
• Ternary search tries
• Hash trie See more