w3resource

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


19. Remove and Return First

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:

Java Collection Linked-list: Remove and return the first element of a linked list.

Flowchart:

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

For more Practice: Solve these Related Problems:

  • Write a Java program to remove the first element from a linked list and return it, then print the remaining list.
  • Write a Java program to implement a method that pops the head of a linked list and handles empty-list exceptions.
  • Write a Java program to remove and return the first element using recursion while preserving the rest of the list.
  • Write a Java program to compare the removed first element with the new head to verify correctness.

Go to:


PREV : Copy LinkedList.
NEXT : Peek First Element.

Java Code Editor:

Contribute your code and comments through Disqus.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Follow us on Facebook and Twitter for latest update.