Generic HashSet using Binary Search Tree

This custom implementation of HashSet uses a Generic Binary Search Tree as an underlying data structure for chaining. It works with any generic Java Collection that implements Comparable interface. Methods implemented:

• public boolean add(E e)
• public boolean addAll(SetI<? extends E> c)
• public boolean containsAll(SetI<?> c)
• public boolean removeAll(SetI<?> c)
• public void clear()
• public boolean contains(Object o)
• public boolean isEmpty()
• public boolean remove(Object o)
• public int size()
• public Object[] toArray()
• public String toString()