binary tree

English

Noun

binary tree (plural binary trees)

1. (mathematics, computer science) 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

data structure

• Catalan: arbre binari (ca) m
• Chinese:

  Mandarin: 二叉树 (zh) (èrchāshù)

• Czech: binární strom m
• Finnish: binääripuu (fi)
• French: arbre binaire (fr) m
• Galician: árbore binária f
• German: Binärbaum m
• Greek: δυαδικό δέντρο (el) n (dyadikó déntro)
• Icelandic: tvíundatré n, tvíundartré n, tvíundahrísla f
• Italian: albero binario m
• Polish: drzewo binarne (pl) n
• Portuguese: árvore binária f
• Romanian: arbore binar m
• Spanish: árbol binario m
• Swedish: binärträd (sv) n

See also

• quadtree

Further reading

• binary tree on Wikipedia.Wikipedia