dequeue - Double Ended Queue implementation using double linked list
import java.util.*;
class Mydequeue
{
public static void main(String args[])
{
LinkedList<Integer> deq = new LinkedList<Integer>();
deq.add(10);
deq.add(20);
deq.addLast(30);
System.out.println("The Deque is: " + deq);
deq.addFirst(5);
System.out.println("After inserting an element at first position Deque is : " + deq);
deq.removeFirst();
System.out.println("After removing first element Deque is : " + deq);
deq.removeLast();
System.out.println("After removing the last element Deque is : " + deq);
}
}
class Mydequeue
{
public static void main(String args[])
{
LinkedList<Integer> deq = new LinkedList<Integer>();
deq.add(10);
deq.add(20);
deq.addLast(30);
System.out.println("The Deque is: " + deq);
deq.addFirst(5);
System.out.println("After inserting an element at first position Deque is : " + deq);
deq.removeFirst();
System.out.println("After removing first element Deque is : " + deq);
deq.removeLast();
System.out.println("After removing the last element Deque is : " + deq);
}
}
Comments
Post a Comment