LinkedList Iterator descendingIterator() method Example Program

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

Program

package com.candidjava;

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

/**
 * 
 * @author : mohan
 * @description :The java.util.LinkedList.descendingIterator() method returns an
 *              iterator over the elements in this deque in reverse sequential
 *              order.
 */
public class LinkedListDescending {
	public static void main(String[] args) {
		LinkedList list = new LinkedList();
		list.add("anandh");
		list.add("hari");
		list.add("vinoth");
		list.add("mohan");
		System.out.println("LinkedList:" + list);
		Iterator x = list.descendingIterator();
		while (x.hasNext()) {
			System.out.println(x.next());
		}
	}
}

Output

Explanation

Comments

Submit