Iterate a LinkedList in Reverse Order in Java
Last Updated :
28 Jan, 2021
For traversing a linked list in reverse order we can use Descending Iterator or List Iterator
1. Descending Iterator
Syntax:
LinkedList<String> linkedlist = new LinkedList<>();
Iterator<String> listIterator = linkedlist.descendingIterator();
Returns: Descending Iterator returns the Iterator that points to the end of the linked list.
2. List Iterator
Syntax:
LinkedList<String> linkedlist = new LinkedList<>();
ListIterator<String> listIerator = linkedlist.listIterator(linkedlist.size());
Parameter: the size of the linked list, this will make the iterator point at the end of the linked list.
Example 1: Using descending Iterator
Java
import java.util.Iterator;
import java.util.LinkedList;
public class GFG {
public static void main(String[] args)
{
LinkedList<String> linkedList = new LinkedList<>();
linkedList.add( "Geeks" );
linkedList.add( "For" );
linkedList.add( "Geek" );
linkedList.add( "2020" );
linkedList.add( "2021" );
Iterator<String> iterator = linkedList.descendingIterator();
while (iterator.hasNext())
{
System.out.println(iterator.next());
}
}
}
|
Output
2021
2020
Geek
For
Geeks
Example 2: Using List Iterator
Java
import java.util.LinkedList;
import java.util.ListIterator;
public class GFG {
public static void main(String[] args)
{
LinkedList<String> linkedList = new LinkedList<>();
linkedList.add( "Geeks" );
linkedList.add( "For" );
linkedList.add( "Geek" );
linkedList.add( "2020" );
linkedList.add( "2021" );
ListIterator<String> listIterator = linkedList.listIterator(linkedList.size());
while (listIterator.hasPrevious())
{
System.out.println(listIterator.previous());
}
}
}
|
Output
2021
2020
Geek
For
Geeks
Share your thoughts in the comments
Please Login to comment...