Java: Iterate a linked list in reverse order.
4. Iterate in Reverse Order
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:

For more Practice: Solve these Related Problems:
- Write a Java program to reverse iterate a linked list using a descending iterator and print each element.
 - Write a Java program to recursively traverse a linked list in reverse order without modifying the list.
 - Write a Java program to convert a linked list into a stack and then pop all elements to display them in reverse order.
 - Write a Java program to implement reverse iteration by first reversing the linked list and then iterating normally.
 
Go to:
PREV : Iterate from Specific Position.
NEXT : Insert Element at Position.
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.
