Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01451512n
Noun Concept
ES
No term available
EN
In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right". Wikipedia
Relations
Sources
IS A
concepto
árbol k-ario
HAS KIND
EN
ternary search tree
EN
Tree of primitive Pythagorean triples
FOLLOWS
árbol binario
STUDIED BY
teoría de grafos

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