Characteristics of a binary search tree

As we learned earlier, binary search trees are just binary trees that follow the binary search property. As a result, binary search trees have some unique characteristics. Let us look at some of the unique properties of a binary search tree.

Minimum

We know that in a binary search tree, for any given node, all the values in its left subtree are less than the value at the given node. This logic makes it easy to see where the minimum value in a binary search tree would reside.