Java Tutorials with Internals

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...

There are so many questions comes into mind when we go to the coding floor and starts writing the code for list like how to traverse the list in java? What are the different ways to traverse a list? Which is the best way? Which way needs to be followed? Here, we will try to find out the answers of these questions. There are two ways to traverse the list - forward or backward. The list has given methods like next and previous. We can iterate the list starting from a specific index too. Output : Iterating list in forward direction... one two three four five Iterating list in backward direction... five four three two one Iterating list from specified position... three four five Look at my other posts: Stack in Java Custom Stack Implementation Set Interface in Java Custom Doubly LinkedList Implementation Custom LinkedList Implementation How to fetch elements from LinkedList List Traversal How to insert elements in List How to remove element...