TreeSet pollLast() method in Java with Example
The pollLast() method of Java.util.concurrent.TreeSet is an in-built function in Java which returns retrieves and removes the last (highest) element, or returns null if this set is empty.
Syntax:
public E pollLast()
Return Value: The function returns retrieves and removes the last (highest) element, or returns null if this set is empty.
Below programs illustrate the TreeSet.pollLast() method:
Program 1:
import java.util.*;
class TreeSetpollLastExample1 {
public static void main(String[] args)
{
TreeSet<Integer> set
= new TreeSet<Integer>();
for ( int i = 10 ; i <= 50 ; i += 10 )
set.add(i);
System.out.println( "Contents of the set: " + set);
System.out.println( "The Last element of the set: "
+ set.pollLast());
System.out.println( "Contents of the set after pollLast: "
+ set);
}
}
|
Output:
Contents of the set: [10, 20, 30, 40, 50]
The Last element of the set: 50
Contents of the set after pollLast: [10, 20, 30, 40]
Program 2:
import java.util.*;
class TreeSetpollLastExample2 {
public static void main(String[] args)
{
TreeSet<Integer> set
= new TreeSet<Integer>();
System.out.println( "Contents of the set: "
+ set);
System.out.println( "The Last element of the set: "
+ set.pollLast());
}
}
|
Output:
Contents of the set: []
The Last element of the set: null
Last Updated :
24 Dec, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...