LinkedList descendingIterator() method in java

Let’s learn linkedlist descendingiterator() method in java.

LinkedList descendingIterator() method in java

descendingIterator() method returns an iterator over the elements in this deque in reverse sequential order. The elements will be returned in order from last (tail) to first (head).

Syntax

public Iterator<E> descendingIterator()

Example

import java.util.*;

class LinkedListDescendingIteratorDemo 
{
   public static void main(String[] args) 
   {
      LinkedList<String> ll = new LinkedList<String>();
      ll.add("hello");
      ll.add("world");
      ll.add("core");
      ll.add("java");
      ll.add("programming");
      System.out.println("LinkedList elements : " + ll);
      Iterator<String> itr = ll.descendingIterator();
      System.out.println("LinkedList descendingIterator() elements : ");
      while(itr.hasNext())
      {
         System.out.print(itr.next() + " ");
      }
   }
}

Output:

LinkedList elements : [hello, world, core, java, programming]
LinkedList descendingIterator() elements :
programming java core world hello

import java.util.*;

class LinkedListDescendingIteratorDemo 
{
   public static void main(String[] args) 
   {
      LinkedList<Integer> ll = new LinkedList<Integer>();
      ll.add(2);
      ll.add(4);
      ll.add(6);
      ll.add(8);
      ll.add(10);
      System.out.println("LinkedList elements : " + ll);
      Iterator<Integer> itr = ll.descendingIterator();
      System.out.println("LinkedList Integers in reversed order : ");
      while(itr.hasNext())
      {
         System.out.print(itr.next() + " ");
      }
   }
}

Output:

LinkedList elements : [2, 4, 6, 8, 10]
LinkedList Integers in reversed order :
10 8 6 4 2