A binar search tree is a commonly used tree structure where the left child's key value is smaller than the parent's key, while the right child's key value is greater or equal to the parent's key