binary search tree (BST)
RU: двоичное дерево поиска (BST)
A binary tree in which, for every node, all values in the left subtree are smaller than the node's value and all values in the right subtree are greater. This ordering lets search, insert, and delete follow a single root-to-leaf path, costing O(h) for tree height h.