Java: Retrieve and remove the last element of a tree set
Write a Java program to retrieve and remove the last element of a tree set.
Sample Solution:
Java Code:
import java.util.TreeSet;
import java.util.Iterator;
public class Exercise15 {
public static void main(String[] args) {
// creating TreeSet
TreeSet <Integer>tree_num = new TreeSet<Integer>();
TreeSet <Integer>treeheadset = new TreeSet<Integer>();
// Add numbers in the tree
tree_num.add(10);
tree_num.add(22);
tree_num.add(36);
tree_num.add(25);
tree_num.add(16);
tree_num.add(70);
tree_num.add(82);
tree_num.add(89);
tree_num.add(14);
System.out.println("Original tree set: "+tree_num);
System.out.println("Removes the last element: "+tree_num.pollLast());
System.out.println("Tree set after removing last element: "+tree_num);
}
}
Sample Output:
Original tree set: [10, 14, 16, 22, 25, 36, 70, 82, 89] Removes the last element: 89 Tree set after removing last element: [10, 14, 16, 22, 25, 36, 70, 82]
Flowchart:
Java Code Editor:
Contribute your code and comments through Disqus.
Previous: Retrieve and remove the first element of a tree set.
Next: Remove a given element from a tree set.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics