SortedSet Interface in Java

Last Updated: 07 July, 2023

SortedSet is an interface in the Java Collections Framework that extends the Set interface. Sorted was introduced in the JDK 1.2 version and is available in the java.util package.

It maintains a collection of elements in ascending order, sorted according to the elements' natural ordering or according to a Comparator provided at SortedSet creation time.

SortedSet declaration:

 public interface SortedSet<E> extends Set<E>

Here, E defines the type of elements that the Set will contain.

The SortedSet interface can be implemented by the following classes in Java:

TreeSet: A sorted set that uses a binary search tree to store its elements.

LinkedHashSet: A sorted set that maintains a doubly linked list of its elements.

EnumSet: A sorted set that is used to store elements of an enumerated type.

Here's an example of how to use SortedSet in Java:

👉 Java SortedSet Example

  
  import java.util.SortedSet;
  import java.util.TreeSet;
  public class SortedSetExample {
    public static void main(String[] args) {
        // Create a TreeSet (a concrete implementation of SortedSet)
        SortedSet<Integer> sortedSet = new TreeSet<>();
          
        // Add elements to the sorted set
        sortedSet.add(5);
        sortedSet.add(2);
        sortedSet.add(8);
        sortedSet.add(1);
        sortedSet.add(4);
        
        // Print the sorted set
        System.out.println("Sorted Set: " + sortedSet);
        
        // Iterate over the sorted set in ascending order
        System.out.print("Ascending Order: ");
        for (Integer num : sortedSet) {
            System.out.print(num + " ");
        }
        System.out.println();
        
        // Get the first and last elements in the sorted set
        System.out.println("First Element: " + sortedSet.first());
        System.out.println("Last Element: " + sortedSet.last());
        
        // Remove an element from the sorted set
        sortedSet.remove(2);
        System.out.println("Sorted Set after removal: " + sortedSet);
    }
 }

Sorted Set: [1, 2, 4, 5, 8]
Ascending Order: 1 2 4 5 8
First Element: 1
Last Element: 8
Sorted Set after removal: [1, 4, 5, 8]

In the example above, we create a TreeSet, which is a commonly used implementation of SortedSet. We add some integers to the set, and they are automatically sorted in ascending order. We can iterate over the set in ascending order using a for-each loop. We can also retrieve the first and last elements of the set using the first() and last() methods. Finally, we remove an element from the set using the remove() method, and the set is updated accordingly.

SortedSet Interface in Java

👉 Java SortedSet Example

Currently No Video available