noun
binary search tree
A data structure in computer science where each node has at most two children, with the left subtree containing smaller values and the right subtree larger values.
二分探索木を使うと、データの検索が効率的に行えます。
Using a binary search tree allows efficient data searching.
このアルゴリズムは二分探索木の挿入操作を実装しています。
This algorithm implements the insertion operation for a binary search tree.