Description
Program to iterate a LinkedList in reverse order using descendingIterator() method of LinkedList class.
Program
import java.util.LinkedList; import java.util.Iterator; class LinkedListDemo { public static void main(String[] args) { // create a LinkedList LinkedList<String> list = new LinkedList<String>(); // Adding elements to the LinkedList list.add("Element1"); list.add("Element2"); list.add("Element3"); list.add("Element4"); // Displaying LinkedList elements System.out.println("LinkedList elements: "+list); /* public Iterator<E> descendingIterator(): Returns an * iterator over the elements in this list in reverse * sequential order. The elements will be returned in * order from last (tail) to first (head). */ Iterator it = list.descendingIterator(); // Displaying list in reverse order System.out.println("Elements in Reverse Order:"); while (it.hasNext()) { System.out.println(it.next()); } } }
Output:
LinkedList elements: [Element1, Element2, Element3, Element4] Elements in Reverse Order: Element4 Element3 Element2 Element1
Hi Chaitanya,
Is this same as the ListIterator backward iteration or some other operations can also be performed using the reverse sequential order
thanks
mani