Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02380701n
Noun Concept
SYL
No term available
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
Relations
Sources
IS A
EN
data structure
EN
ternary tree
EN
search tree
STUDIED BY
EN
graph theory

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