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.
随便看	hieromnemon的意思 hieromonach的意思 hieromonk的意思 hieron的意思 Hieron II的意思 hieronosus的意思 hieron的意思 hieronymic的意思 Hieronymite的意思 Hieronymite的意思 Hieronymous的意思 Hieronymus的意思 Hieronymus Bosch的意思 hieronymus bosches的意思 Hieronymus, Eusebius的意思 hieronymuss的意思 hierophanic的意思 hierophanical的意思 hierophanically的意思 hierophant的意思 hierophant的意思 hierophant的意思 hierophant的意思 Hierophany的意思 hierophobia的意思

PATRICIA tree

Radix tree