Theorem 13.6: The average height of a randomly built BST on n distinct keys is O(lg n). By randomly built we mean that keys are inserted in random order.