Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02479296n
Noun Concept
Categories: Articles with short description, Finite automata, Trees (data structures)
EN
trie  B-trie  Bitwise tries  Compressing tries  digital tree
EN
In computer science, a trie, also called digital tree or prefix tree, is a type of k-ary search tree, a tree data structure used for locating specific keys from within a set. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a trie, also called digital tree or prefix tree, is a type of k-ary search tree, a tree data structure used for locating specific keys from within a set. Wikipedia
A prefix tree in computer science Wikipedia Disambiguation
In computer science: ordered tree data structure used to store a dynamic set or associative array where the keys are usually strings Wikidata
An ordered tree data structure that is used to store an associative array where the keys are usually strings. Wiktionary
Data structure. Wiktionary (translation)
IS A
search tree
HAS KIND
prefix hash tree
Patricia tree
x-fast trie
y-fast trie
Ctrie
+2 relations
DIFFERENT FROM
tree
STUDIED BY
graph theory
Wikipedia
EN
trie
Wikidata
EN
trie
Wiktionary
EN
trie
Wikipedia Redirections
EN
B-trie, Bitwise tries, Compressing tries, digital tree, prefix tree
Wikidata Alias
EN
digital tree, prefix tree, radix tree

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