Radix tree

In computer science, a radix tree (also radix trie or compact prefix tree) is a data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent. The result is that the number of children of every internal node is at least the radix $r$ of the radix trie, where $r$ is a positive integer and a power $x$ of 2, having $x$ ≥ 1. Unlike in regular tries, edges can be labeled with sequences of elements as well as single elements. This makes radix trees much more efficient for small sets (especially if the strings are long) and for sets of strings that share long prefixes.

单词	PATRICIA tree
释义	PATRICIA tree 英语百科 Radix tree In computer science, a radix tree (also radix trie or compact prefix tree) is a data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent. The result is that the number of children of every internal node is at least the radix $r$ of the radix trie, where $r$ is a positive integer and a power $x$ of 2, having $x$ ≥ 1. Unlike in regular tries, edges can be labeled with sequences of elements as well as single elements. This makes radix trees much more efficient for small sets (especially if the strings are long) and for sets of strings that share long prefixes.
随便看	electronphilic electronphobic electronphonic music electron phonon collision electron phonon interaction electronphoresis electronphoresis tank electronphoretic analysis electronphoretic clarification electronphoretogram electron photography electron photomicrograph electron physics electron pickup by charged particles electron picture electron plasma Electron plasma frequency electron plasma wave electron plate electronplate electronplating electron polarization electron pole electron population electron population analysis

PATRICIA tree

Radix tree