Efficiency Issues with BSTs

A binary tree is either empty or it consists of three parts:

• A root

• A left subtree which is a binary tree

• A right subtree which is a binary tree

Note the absence of an ordering property.

The efficiency of searching BSTs is dependent on a property of all binary trees, namely their height.