Definition 3.8 Let S be a set that is totally ordered by ?. A binary search tree on
S is
B1. The empty tree, or
B2. a single vertex $r \in S$. In this case, $r$ is the root of the tree.
R. If $T_1$ and $T_2$ are binary search trees with roots $r_1$ and $r_2$, respectively, and if
$a \le r$ for all nodes $a \in T_1$ and $r \le b$ for all nodes $b \in T_2$, then the tree
is a binary search tree with root $r$.