BabelNet

bn:01451512n

Noun Concept

No term available

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

conceito

k-ary tree

HAS KIND

Árvore ternária de busca

Tree of primitive Pythagorean triples

FOLLOWS

árvore binária

STUDIED BY

teoria dos grafos