/ ˈbaɪnəri ˈtriː /
In programming, a specific type of tree data structure in which each node has at most two subtrees, one left and one right. Binary trees are often used for sorting information; each node of the binary search tree contains a key, with values less than that key added to one subtree and values greater than that key added to the other. See the illustration. See also binary search, tree.