Java: Remove a given element from a tree set

Last update on March 12 2025 13:34:15 (UTC/GMT +8 hours)

Write a Java program to remove a given element from a tree set.

Sample Solution:

Java Code:

import java.util.TreeSet;
import java.util.Iterator;

  public class Exercise16 {
  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 70 from the list: "+tree_num.remove(70));
   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 70 from the list: true                                         
Tree set after removing last element: [10, 14, 16, 22, 25, 36, 82, 89]

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to remove a specified element from a TreeSet using remove() and then verify its absence.
• Write a Java program to implement a method that removes a given element and returns a boolean indicating success.
• Write a Java program to remove an element from a TreeSet using Java streams to filter out the element and collect the result.
• Write a Java program to remove a specified element from a TreeSet and then print the size before and after removal to verify the operation.

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Retrieve and remove the last element of a tree set.
Next: Create a new priority queue, add some colors (string) and print out the elements of the priority queue.