DescendingIterator: Iterating in Reverse
You'll learn how to traverse a NavigableSet from highest to lowest using descendingIterator().
What Is descendingIterator()?
While descendingSet() gives you a reversed view of your NavigableSet, sometimes you just need to iterate through elements in reverse order without creating a new view. That's exactly what descendingIterator() provides—a specialized iterator that walks through your set from the highest element down to the lowest.
How It Works
The descendingIterator() method returns an Iterator that processes elements in descending order. Think of it like reading a sorted list of names from Z to A instead of A to Z—same data, opposite direction.
TreeSet<Integer> scores = new TreeSet<>();
scores.add(85);
scores.add(92);
scores.add(78);
scores.add(95);
// Normal iteration: 78, 85, 92, 95
Iterator<Integer> ascending = scores.iterator();
while (ascending.hasNext()) {
System.out.print(ascending.next() + " ");
}
System.out.println();
// Reverse iteration: 95, 92, 85, 78
Iterator<Integer> descending = scores.descendingIterator();
while (descending.hasNext()) {
System.out.print(descending.next() + " ");
}
When to Use It
Use descendingIterator() when you need a one-time traversal in reverse order. It's simpler and more efficient than creating a full descendingSet() view if you don't need other navigation methods—just iteration.
Key Takeaway: descendingIterator() provides a lightweight way to traverse a NavigableSet from highest to lowest element using the familiar Iterator pattern, perfect for reverse-order processing without creating a persistent view.