A binary tree is either empty or it consists of three parts:
Note the absence of an ordering property.
The efficiency of searching BSTs is dependent on a property of all binary trees, namely their height.