What is the difference between a HashSet and a TreeSet in Java?

In Java, both HashSet and TreeSet are classes that implement the Set interface in the Java Collections Framework. They both represent an unordered collection of objects with no duplicates, but they have some key differences.

Ordering: A HashSet is an unordered collection, meaning that the order of the elements in the HashSet is not defined. A TreeSet, on the other hand, is an ordered collection, meaning that the elements in the TreeSet are ordered based on their natural ordering or a specified Comparator.

Performance: A HashSet is faster than a TreeSet when it comes to adding or removing elements, as it uses a hash table to store its elements, which provides constant-time performance for most operations. A TreeSet, on the other hand, is slower than a HashSet when it comes to adding or removing elements, as it maintains its elements in a red-black tree, which requires O(log n) time for most operations.

Usage: A HashSet is typically used when order is not important, and when you need fast access to the elements in the collection. A TreeSet is typically used when you need the elements to be ordered, and when you need to perform range queries (e.g. getting all elements between two values) on the collection.

Here’s an example of how to use a HashSet and a TreeSet in Java:

import java.util.HashSet;
import java.util.Set;
import java.util.TreeSet;

public class Example {
    public static void main(String[] args) {
        // create a HashSet
        Set<Integer> myHashSet = new HashSet<>();
        myHashSet.add(5);
        myHashSet.add(10);
        myHashSet.add(15);
        myHashSet.add(10);
        
        // create a TreeSet
        Set<Integer> myTreeSet = new TreeSet<>();
        myTreeSet.add(5);
        myTreeSet.add(10);
        myTreeSet.add(15);
        myTreeSet.add(10);
        
        // print out the contents of the sets
        System.out.println("HashSet: " + myHashSet);
        System.out.println("TreeSet: " + myTreeSet);
    }
}

In this example, we create a HashSet called "myHashSet" and add some integers to it, including a duplicate of the integer 10. We then create a TreeSet called "myTreeSet" and add the same integers to it, including a duplicate of the integer 10. Finally, we print out the contents of both sets using the "println" method.

The output of this program would be:

HashSet: [5, 10, 15]
TreeSet: [5, 10, 15]

As you can see, both sets contain the integers 5, 10, and 15, but the order of the elements in the HashSet is not defined, while the elements in the TreeSet are ordered in ascending order.