- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Remove lowest element in Java TreeSet
To remove the lowest element, use the pollFirst() method.
Create a TreeSet and add elements to it −
TreeSet<String> tSet = new TreeSet<String>(); tSet.add("78"); tSet.add("56"); tSet.add("88"); tSet.add("12");
Now, remove the lowest element −
tSet.pollFirst()
The following is an example to remove lowest element in Java TreeSet −
Example
import java.util.*; public class Demo { public static void main(String args[]){ TreeSet<String> tSet = new TreeSet<String>(); tSet.add("78"); tSet.add("56"); tSet.add("88"); tSet.add("12"); System.out.println("TreeSet elements..."); Iterator<String> i = tSet.iterator(); while(i.hasNext()){ System.out.println(i.next()); } System.out.println("Removing Lowest Value: "+tSet.pollFirst()); System.out.println("Updated TreeSet elements..."); i = tSet.iterator(); while(i.hasNext()){ System.out.println(i.next()); } } }
Output
TreeSet elements... 12 56 78 88 Removing Lowest Value: 12 Updated TreeSet elements... 56 78 88
Advertisements