The SequentialSearchST and BinarySearchST classes are implementations of the symbol table and ordered symbol table, respectively.

Unfortunately, the performance is not good enough to handle clients with a large number of keys.

Additional implementations based on other non-linear structures will effectively overcome this by having methods with improved order of growth properties.

The symbol tables will achieve this better performance by using better private data members.