**Answer: B**

A BST, or Binary Search Tree, is ordered so that all descendants to the left
of a node have a key value that is less, and all descendants to the right
of a node have a key value that is greater. Thus, a search can discard
half the tree at each step, giving a *O(log n)* search time.