LinkedList removeLast() Method in Java

The Java.util.LinkedList.removeLast() method is used to remove the last element from the LinkedList. This method also returns the element after removing it.

Syntax:

LinkedList.removeLast()

Parameters: This function does not take any parameters.



Return Value: The method returns the last element or the element present at the tail of the list.

Below program illustrate the Java.util.LinkedList.removeLast() method:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to illustrate removeLast()
import java.io.*;
import java.util.LinkedList;
  
public class LinkedListDemo {
    public static void main(String args[])
    {
        // Creating an empty LinkedList
        LinkedList<String> list = new LinkedList<String>();
  
        // Use add() method to add elements in the list
        list.add("Geeks");
        list.add("for");
        list.add("Geeks");
        list.add("10");
        list.add("20");
  
        // Displaying the list
        System.out.println("LinkedList:" + list);
  
        // Remove the tail using removeLast()
        System.out.println("The last element is removed: " + list.removeLast());
          
        // Displaying the final list
        System.out.println("Final LinkedList:" + list);
          
        // Remove the tail using removeLast()
        System.out.println("The last element is removed: " + list.removeLast());
  
        // Displaying the final list
        System.out.println("Final LinkedList:" + list);
    }
}

chevron_right


Output:

LinkedList:[Geeks, for, Geeks, 10, 20]
The last element is removed: 20
Final LinkedList:[Geeks, for, Geeks, 10]
The last element is removed: 10
Final LinkedList:[Geeks, for, Geeks]


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.