Java program to get and remove the lowest element from the TreeSet collection

Given a TreeSet collection, we have to get and remove the lowest element.
Submitted by Nidhi, on June 07, 2022

Problem Solution:

In this program, we will create a TreeSet collection with integer elements. Then we will get and remove the lowest element from the TreeSet collection using the pollFirst() method. The pollFirst() method returns null, if the TreeSet is empty.

Program/Source Code:

The source code to get and remove the lowest element from the TreeSet collection is given below. The given program is compiled and executed successfully.

Example of TreeSet.pollFirst() Method in Java

// Java program to get and remove the lowest element 
// from the TreeSet collection

import java.io.*;
import java.util.*;

public class Main {
  public static void main(String args[]) {
    TreeSet < Integer > tree = new TreeSet < Integer > ();

    tree.add(30);
    tree.add(20);
    tree.add(25);
    tree.add(10);

    System.out.println("TreeSet: " + tree);

    int item = tree.pollFirst();

    System.out.println("Removed item is: " + item);
    System.out.println("TreeSet: " + tree);
  }
}

Output:

TreeSet: [10, 20, 25, 30]
Removed item is: 10
TreeSet: [20, 25, 30]

Explanation:

In the above program, we imported the "java.util.*", "java.io.*" packages to use the TreeSet class. Here, we created a public class Main.

The Main class contains a main() method. The main() method is the entry point for the program. And, created a TreeSet collection tree and added integer elements using add() method. Then we get and removed the lowest element from the TreeSet collection using the pollFirst() method and printed the updated TreeSet.

Java TreeSet Programs »



Related Programs



Comments and Discussions!

Load comments ↻





Copyright © 2024 www.includehelp.com. All rights reserved.