TreeSet descendingIterator method returns an iterator with the elements sorted in a descending order.
When inserting any element into TreeSet it automatically gets sorted into its natural sorting order.
TreeSet descendingIterator method is useful when you need a sorted list in descending order but do not want to write a comparator.
|
1 |
public Iterator<E> descendingIterator() |
TreeSet descendingIterator method example
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
package com.kscodes.collections.samples.treeset; import java.util.Iterator; import java.util.TreeSet; public class DescIteratorExample { public static void main(String args[]) { // Create a TreeSet and initialize it TreeSet<String> treeSet = new TreeSet<>(); // Add few elements to the TreeSet treeSet.add("A"); treeSet.add("T"); treeSet.add("Z"); treeSet.add("B"); treeSet.add("E"); // Print the elements that are added System.out.println("Original Sorted TreeSet :: " + treeSet); // Use descendingIterator and check what is returned. Iterator<String> descIterator = treeSet.descendingIterator(); System.out.println("Printing the elements using descendingIterator()"); while (descIterator.hasNext()) { System.out.println(descIterator.next()); } } } |
Output
