SortedSet add() method in Java with Examples

In Java, a particular element can be added to a Set collection using the add() function of SortedSet. This method ensures that the addition of items preserves the set's inherent order because SortedSet implementations, such as TreeSet, automatically sort elements. An element is passed as an argument to the add() method, which returns true if the element is successfully inserted. The method returns false if the element is already present in the set because sets cannot include duplicate elements. For effectively maintaining sorted, distinct sets of items, this approach can be very efficient.

Syntax:

- where E is a particular type of element that this set collection holds.

Parameters: The parameter element refers to the component to be added to the Set and is of the kind of element maintained by this Set.

Return Value: If an element is new and not in the set, the function returns True; if the component is already in the set, it returns False.

Example 1:

The SortedSet interface, which is specially implemented by the TreeSet class, is used in this code to show how to insert elements while still following sorting and uniqueness rules. Element order is maintained by the SortedSet interface (or a custom comparator, if given). The TreeSet uses its underlying Red-Black Tree structure to remove duplicate pieces for effective retrieval and storage automatically. While adding elements, the add() method enforces uniqueness and maintains the sorted order.

Implementation:

Output:

 
The Sorted Set is given by : [JavaTpoint, Welcome, World, the, to]   

Example 2:

In order to ensure that elements are sorted automatically, the code provided utilizes the functionality of the SortedSet interface, which is specially implemented by TreeSet. A natural ordering (ascending for numeric types) is enforced by the TreeSet when integers are added using the add() method. This is accomplished by using a self-balancing binary search tree, usually a Red-Black tree, which guarantees logarithmic time complexity for both the search and insertion processes. Additionally, TreeSet automatically avoids duplicates by ensuring that items are present before adding them. The final result is a collection that is dynamically ordered, with the ordering being inherent to the data structure rather than merely the order of the input.

Implementation:

Output:

 
The Sorted Set is given by : [10, 20, 30, 40, 50]