LinkedList Traversal In Reverse Sequential Order
LinkedList traversal can be done in two directions - Ascending and Descending
The ascending traversal or normal or forward traversal can be done using iterator method provided by List interface whereas for the descending order traversal is possible using method provided by Dequeue interface.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 | package net.raj.test; import java.util.Iterator; import java.util.LinkedList; /** * @author Raj Saxena * */ public class LinkedListTraversalImpl { public static void main(String[] args) { // Declare an LinkedList LinkedList<String> list = new LinkedList<>(); // populate list list.add("one"); list.add("two"); list.add("three"); list.add("four"); list.add("five"); System.out.println("List traversal in ascending order"); // list traversal in ascending order Iterator<String> itr = list.iterator(); while(itr.hasNext()) { System.out.println(itr.next()); } System.out.println("-----------------------------------"); System.out.println("List traversal in descending order"); //list traversal in decending order itr = list.descendingIterator(); while(itr.hasNext()) { System.out.println(itr.next()); } } } |
Output:
List traversal in ascending order
one
two
three
four
five
-----------------------------------
List traversal in descending order
five
four
three
two
one
one
two
three
four
five
-----------------------------------
List traversal in descending order
five
four
three
two
one
Look at my other posts:
Some other interesting blogs:
Comments
Post a Comment