Binary tree exercise is a binary *search* tree

The exercise should be explicit that the trees involved are binary *search* trees, that is, they are binary trees with the additional invariant that all values in the left subtree of a node compare less than the value stored at that node and the same for values that compare greater on the right. We rely on this property for the implementations of the various methods, so we should be clear about it.