w3resource

Java Collection, LinkedList Exercises: 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]

Flowchart:

Flowchart: Remove and return the first element of a linked list

Java Code Editor:

Contribute your code and comments through Disqus.

What is the difficulty level of this exercise?



Inviting useful, relevant, well-written and unique guest posts