What is the performance difference between TreeSet and HashSet in various operations?

HashSet uses a hash table, so add, remove, and search operations are performed on average in O(1). TreeSet is based on a red-black tree, where these operations are performed in O(log n). Therefore, HashSet is faster for basic operations when sorting is not required. TreeSet, on the other hand, stores elements in sorted order, which is useful if ordering is needed, but this reduces performance compared to HashSet.