binary tree
Computing term for a tree data structure where each node has at most two children. The more common term is 二分木 (にぶんぎ).
See also: 二分木
A binary tree is a data structure in which each node has at most two child nodes.
Compound of 二進 (にしん, 'binary') and 木 (ぎ, 'tree'), a direct translation of the English term 'binary tree'.