noun
-ary tree
Technical term in computer science and mathematics. Refers to a tree data structure where each node has a fixed number of children, specified by the prefix (e.g., 二分木 for binary tree).
二分木は各ノードが最大で二つの子ノードを持つデータ構造です。
A binary tree is a data structure where each node has at most two child nodes.
このアルゴリズムは三分木を用いて探索を高速化する。
This algorithm speeds up search by using a ternary tree.