A binary search tree has a root.

Each Node in the tree has a left and a right child link, either of which can be null.

At each Node the key in the Node is greater than all the keys in its left subtree (if not empty) and less than all the keys in its right subtree (if not empty).