Binary Search Tree (BST) Symbol Table

Compare search key to contents of node:

=	Found
<	Search left subtree
>	Search right subtree

Advantage: O(log n) search time if tree is balanced.

Disadvantage: Search time may be long if tree is not balanced.