Class DequeA

queue/deque/DequeA.java:10–145

import java.util.NoSuchElementException;

public class DequeA 
{
	private int[] queueArray;
    private int front;
    private int rear;
	
    public DequeA()
    {
       	queueArray = new int[10];
    	front = -1;
    	rear = -1;
    }
    public DequeA(int maxSize)
    {
    	queueArray = new int[maxSize];
    	front = -1;
    	rear = -1;
    }
    public void insertFront(int x)
	{
		if(isFull())
		{
			System.out.println("Queue Overflow");
			return;
		}
		if(front==-1)
		{	
			front=0;
			rear=0;
		}
		else if(front==0)
			front=queueArray.length-1;
		else
			front=front-1;
		queueArray[front]=x;
	}

    public void insertRear(int x)
	{
		if(isFull())
		{
			System.out.println("Queue Overflow");
			return;
		}
		if(front==-1)  
			front=0;
		
		if(rear==queueArray.length-1)  
			rear=0;
		else
			rear=rear+1;
		queueArray[rear]=x;
	}

    public int deleteFront()
	{
		int x;
		if( isEmpty() )