二に進しん木ぎ

noun

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.