binary tree
From Wiktionary, the free dictionary
English
[edit ]Pronunciation
[edit ]Noun
[edit ]binary tree (plural binary trees )
- (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
[edit ]Derived terms
[edit ]Translations
[edit ]data structure
- Catalan: arbre binari (ca) m
- Chinese:
- 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
[edit ]Further reading
[edit ]- binary tree on Wikipedia.Wikipedia