Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00694262n
Noun Concept
Categories: String data structures, Trees (data structures)
EN
Patricia tree  radix tree  PATRICIA trie  compact prefix tree  Crit-bit tree
EN
In computer science, a radix 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. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a radix 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. Wikipedia
A computer science data structure Wikipedia Disambiguation
A type of set data structure Wikipedia Disambiguation
Data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent Wikidata
A radix tree with radix of 2, meaning that each bit of the key is compared individually and each node is a two-way branch. Wiktionary
A space-optimized trie data structure in which each node that is the only child is merged with its parent. Wiktionary
IS A
trie
HAS KIND
suffix tree
STUDIED BY
graph theory
Wikipedia
EN
radix tree
Wikidata
EN
Patricia tree
Wiktionary
EN
Patricia tree, radix tree
Wikipedia Redirections
EN
compact prefix tree, Crit-bit tree, Crit bit tree, Crit bit trie, PATRICIA, Patricia-trie, Patricia tree, Patricia trees, Patricia trie, PATRICIA trie, radix trie, Radixtree
Wikidata Alias
EN
compact prefix tree, radix trie

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License