A binary search tree is a tree data structure in which each node has at most two children, referred to as the left and right child. For each node, all elements in the left subtree are less than the node's value, and all elements in the right subtree are greater.
