A binary search tree implementation of the symbol table type can be more efficient than the array implementation class BinarySearchST.

The value associated with a key plays no role in the implementation of the put, get and delete symbol table methods.

If we omit the value and just keep the key, a symbol table reduces to a collection of distinct keys. But the implementation of the put, get, and delete methods will be the same.

We will examine a binary search tree implementation of such a class, BSTSet, which stores keys only and to simplify things a bit more, we will use only integer keys.