binary tree

English

Noun

binary tree (plural binary trees)

1. (mathematics, computing) A data structure in which each node has at most two children, each node but the root has one parent, and there are no cycles.

Hypernyms

• tree

Derived terms

• full binary tree

Translations

a data structure

• Catalan: arbre binari (ca) m
• Czech: binární strom m
• Finnish: binääripuu (fi)
• French: arbre binaire (fr) m
• Galician: árbore binária f
• German: Binärbaum m
• (deprecated template usage) {{trans-mid}}
• Icelandic: tvíundatré n, tvíundartré n, tvíundahrísla f
• Italian: albero binario m
• Portuguese: árvore binária f
• Romanian: arbore binar m
• Spanish: árbol binario m
• Swedish: binärträd (sv) n

References

• binary tree on Wikipedia.Wikipedia