1. Radix treeIn 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 at least two children. Unlike in regular tries, edges can be labeled with sequences of characters as well as single characters.
Read “Radix tree” on English Wikipedia
Read “基数木” on Japanese Wikipedia
Read “Radix tree” on DBpedia
Read “Radix tree” on English Wikipedia
Read “基数木” on Japanese Wikipedia
Read “Radix tree” on DBpedia
Discussions
Log in to talk about this word.