Java: Retrieve but does not remove, the last element of a linked list
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:
Java Code Editor:
Contribute your code and comments through Disqus.
Previous: Retrieve but does not remove, the first element of a linked list.
Next: Check if a particular element exists in 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