Java: Create a reverse order view of the elements contained in a given tree set
Java Collection, TreeSet Exercises: Exercise-4 with Solution
Write a Java program to create a reverse order view of the elements contained in a given tree set.
Sample Solution:
Java Code:
import java.util.TreeSet;
import java.util.Iterator;
public class Exercise4 {
public static void main(String[] args) {
// create an empty tree set
TreeSet<String> t_set = new TreeSet<String>();
// use add() method to add values in the tree set
t_set.add("Red");
t_set.add("Green");
t_set.add("Black");
t_set.add("Pink");
t_set.add("orange");
// print original list
System.out.println("Original tree set:" + t_set);
Iterator it = t_set.descendingIterator();
// Print list elements in reverse order
System.out.println("Elements in Reverse Order:");
while (it.hasNext()) {
System.out.println(it.next());
}
}
}
Sample Output:
Original tree set:[Black, Green, Pink, Red, orange] Elements in Reverse Order: orange Red Pink Green Black
Flowchart:
Java Code Editor:
Contribute your code and comments through Disqus.
Previous: Add all the elements of a specified tree set to another tree set.
Next: Get the first and last elements in a tree set.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.
https://www.w3resource.com/java-exercises/collection/java-collection-tree-set-exercise-4.php
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics