how to iterate through linked list in reverse order?

by

LinkedList:

The LinkedList class extends AbstractSequentialList and implements the List and Deque interface. It uses linked list data structure to store elements. It can contain duplicate elements. It is not synchronized.

Note: It not provides the random access facility.

We can use descendingIterator() method to iterate through linked list in reverse order. It returns an Iterator object with reverse order.

Example:

package com.w3schools;
 
import java.util.Iterator;
import java.util.LinkedList;
 
public class Test {
  public static void main(String args[]){
	LinkedList<String> linkedList = new LinkedList<String>();
	linkedList.add("Jai");
	linkedList.add("Mahesh");
	linkedList.add("Naren");
	linkedList.add("Vivek");
	linkedList.add("Vishal");
	linkedList.add("Hemant");
	System.out.println("Actual LinkedList:"+linkedList);
	Iterator<String> iterator = linkedList.descendingIterator();
        while(iterator.hasNext()){
            System.out.println(iterator.next());
        }
  }
}

Output

Actual LinkedList:[Jai, Mahesh, Naren, Vivek, Vishal, Hemant]
Hemant
Vishal
Vivek
Naren
Mahesh
Jai