Java: Remove first and last element from a linked list
Write a Java program to remove the first and last elements from a linked list.
Sample Solution:-
Java Code:
import java.util.*;
public class Exercise13 {
public static void main(String[] args) {
// create an empty linked list
LinkedList<String> l_list = new LinkedList<String>();
// use add() method to add values in the linked list
l_list.add("Red");
l_list.add("Green");
l_list.add("Black");
l_list.add("Pink");
l_list.add("orange");
// print the list
System.out.println("The Original linked list: " + l_list);
// Remove the first element
Object firstElement = l_list.removeFirst();
System.out.println("Element removed: "+ firstElement);
// Remove the last element
Object lastElement = l_list.removeLast();
System.out.println("Element removed: "+ lastElement);
System.out.println("The New linked list: " + l_list);
}
}
Sample Output:
The Original linked list: [Red, Green, Black, Pink, orange] Element removed: Red Element removed: orange The New linked list: [Green, Black, Pink]
Pictorial Presentation:
Flowchart:
Java Code Editor:
Contribute your code and comments through Disqus.
Previous: Remove a specified element from a linked list.
Next: Remove all the elements from a linked list.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics