Binary Search Tree Definition
A binary search tree (BST) is either empty or it consists of
three parts:
- a root
- a left subtree which is a BST
- a right subtree which is a BST
The root is an element that is:
- greater than or equal to every element
in the left subtree, and
- less than or equal to every element
in the right subtree.