Java: Iterate a linked list in reverse order.

Last update on December 21 2024 09:36:23 (UTC/GMT +8 hours)

Write a Java program to iterate a linked list in reverse order.

Sample Solution:-

Java Code:

import java.util.LinkedList;
import java.util.Iterator;
  public class Exercise4 {
  public static void main(String[] args) {
    // create an empty linked list
     LinkedList<String> l_list = new LinkedList<String>();
   // use add() method to add values in the linked list
          l_list.add("Red");
          l_list.add("Green");
          l_list.add("Black");
          l_list.add("Pink");
          l_list.add("orange");
      
        // print original list
   System.out.println("Original linked list:" + l_list);  
 
    Iterator it = l_list.descendingIterator();

     // Print list elements in reverse order
     System.out.println("Elements in Reverse Order:");
     while (it.hasNext()) {
        System.out.println(it.next());
     }
  }
}

Sample Output:

Original linked list:[Red, Green, Black, Pink, orange]                 
Elements in Reverse Order:                                             
orange                                                                 
Pink                                                                   
Black                                                                  
Green                                                                  
Red 

Pictorial Presentation:

Flowchart:

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Iterate through all elements in a linked list starting at the specified position.
Next: Insert the specified element at the specified position in the linked list.