Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02380701n
Noun Concept
Categories: Computing articles needing expert attention, Trees (data structures), Search algorithms
EN
ternary search tree  Ternary search trie  Ternary search tries  TST
EN
In computer science, a ternary search tree is a type of trie where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a ternary search tree is a type of trie where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Wikipedia
A ternary tree data structure of strings Wikipedia Disambiguation
IS A
data structure
ternary tree
search tree
STUDIED BY
graph theory
Wikipedia
EN
ternary search tree
Wikidata
EN
ternary search tree
Wikipedia Redirections
EN
Ternary search trie, Ternary search tries
Wikidata Alias
EN
TST

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