Java: Retrieve but does not remove, the last element of a linked list

Last update on May 22 2025 13:15:56 (UTC/GMT +8 hours)

21. Peek Last Element

Write a Java program to retrieve, but not remove, the last element of a linked list.

Sample Solution:-

Java Code:

import java.util.*;

public class Exercise21 {
 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);    
     // Retrieve but does not remove, the last element of a linked list
        String x = c1.peekLast();
    System.out.println("Last element in the list: " + x);
    System.out.println("Original linked list: " + c1);
    
 }
}

Sample Output:

Original linked list: [Red, Green, Black, White, Pink]                 
Last element in the list: Pink                                         
Original linked list: [Red, Green, Black, White, Pink]

Pictorial Presentation:

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to get the last element of a linked list without removing it using peekLast().
• Write a Java program to traverse a linked list to find and return the tail element without modifying the list.
• Write a Java program to implement a recursive method to retrieve the last element of a linked list.
• Write a Java program to compare the last element retrieved by traversal with that obtained by converting the list to an array.

Go to:

• Java Collection Exercises Home ↩
• Java Exercises Home ↩

PREV : Peek First Element.
NEXT : Check Element Exists.

Java Code Editor:

Contribute your code and comments through Disqus.