Sanakirja
Tekoälykääntäjä
Ääntäminen
US
| Kieli | Käännökset |
|---|---|
| espanja | árbol binario |
| ruotsi | binärträd |
| suomi | binääripuu |
Määritelmät
Substantiivi
- (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.
Taivutusmuodot
| Monikko | 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.
A labeled binary tree of size 9 (the number of nodes in the tree) and height 3 (the height of a tree defined as the number of edges or links from the top-most or root node to the farthest leaf node), with a root node whose value is 1. The above tree is unbalanced and not sorted.
(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.
An ancestry chart which can be mapped to a perfect 4-level binary tree.
(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.
A small complete binary tree stored in an array