A binary search tree (BST) is a data structure that allows fast searching of data. It can be used to store a sorted list of items. The tree is binary because it has two children for each node at most. A binary search tree is a binary search tree if and only if the following two conditions are met:
The left child of a node is less than the node itself.
The right child of a node is greater than the node itself.
