Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01451512n
Noun Concept
Categories: Trees (data structures)
EN
ternary tree  3-ary tree
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
Definitions
Relations
Sources
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
A tree data structure in computer science Wikipedia Disambiguation
IS A
concept
k-ary tree
HAS KIND
ternary search tree
Tree of primitive Pythagorean triples
FOLLOWS
binary tree
STUDIED BY
graph theory
Wikipedia
EN
ternary tree
Wikidata
EN
ternary tree
Wikidata Alias
EN
3-ary 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