Get iterator from LinkedList

Iterator<E> descendingIterator()
Returns an iterator over the elements in this deque in reverse sequential order.
ListIterator<E> listIterator(int index)
Returns a list-iterator of the elements in this list (in proper sequence), starting at the specified position in the list.

  import java.util.Iterator;
import java.util.LinkedList;

public class Main{
    public static void main(String args[]) {
        LinkedList<String> ll = new LinkedList<String>();

        ll.add("A");
        ll.add("ja v a2s.com");
        ll.addLast("B");
        ll.add("C");

        Iterator<String> itr = ll.iterator();
        while (itr.hasNext()) {
            String element = itr.next();
            System.out.print(element + " ");
        }
    }
}
  

The output:


A ja v a2s.com B C

  import java.util.LinkedList;
import java.util.ListIterator;

public class Main{
    public static void main(String args[]) {
        LinkedList<String> ll = new LinkedList<String>();

        ll.add("A");
        ll.add("ja v a2s.com");
        ll.addLast("B");
        ll.add("C");

        ListIterator<String> itr = ll.listIterator(1);
        while (itr.hasNext()) {
            String element = itr.next();
            System.out.print(element + " ");
        }
    }
}
  

The output:


ja v a2s.com B C
Home 
  Java Book 
    Collection  

LinkedList:
  1. LinkedList class
  2. Create LinkedList
  3. Add element to LinkedList
  4. Remove all elements from LinkedList
  5. Shallow copy of a LinkedList
  6. If contain a certain element
  7. Get iterator from LinkedList
  8. Peek the element
  9. Get the element from LinkedList
  10. Get the index of an element
  11. Poll, pop and push element to a LinkedList
  12. Remove element from a LinkedList
  13. Replace the element at the position
  14. Get the size of a LinkedList
  15. Convert LinkedList to Array
  16. Storing User-Defined Classes in Collections