Java: Remove and return the first element of a linked list
Java Collection, LinkedList Exercises: Exercise-19 with Solution
Write a Java program to remove and return the first element of a linked list.
Sample Solution:-
Java Code:
import java.util.*;
public class Exercise19 {
public static void main(String[] args) {
// create an empty linked list
LinkedList <String> c1 = new LinkedList <String> ();
c1.add("Red");
c1.add("Green");
c1.add("Black");
c1.add("White");
c1.add("Pink");
System.out.println("Original linked list: " + c1);
System.out.println("Removed element: "+c1.pop());
System.out.println("Linked list after pop operation: "+c1);
}
}
Sample Output:
Original linked list: [Red, Green, Black, White, Pink] Removed element: Red Linked list after pop operation: [Green, Black, White, Pink]
Pictorial Presentation:
Flowchart:
Java Code Editor:
Contribute your code and comments through Disqus.
Previous: Clone an linked list to another linked list.
Next: Retrieve but does not remove, the first element of a linked list.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.
https://www.w3resource.com/java-exercises/collection/java-collection-linked-list-exercise-19.php
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics