hashtableBST

This implementation uses a hash table of size 3 where each bucket in the table is a root of a binary search tree.