deque class having problems in inserting dATA INTO THE QUEUE

[Aqeel Abbas]

HI ALL
i am having problem in inserting data into the queue....will some one help me to fix it ?

// deque assng2.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
using namespace std;

template<class type>
class deque
{
	type front,rear;
	type MAX;
	type* items;
public:
	deque(int max)
	{
		front=-1;rear=-1;
		MAX=max;
		items=new type[max];
	}
	void insertfront(type a)
	{
		if(isempty())
		{
				front=0;rear=0;
				items[front]=a;
		}
		else if(isfull())
			cout<<"Over flow\n";
		else if(front==MAX-1)
		{
			front=0;
		}
		else
		{
			items[front]=a;
		}
	}

	void insertrear(type a)
	{
		if(isempty())
		{
				front=0;rear=0;
				//items[rear]=a;
		}
		else if(isfull())
			cout<<"Over flow\n";
		else if(rear==0)
		{
			//items[rear]=a;
			rear=MAX-1;
		}
		else
		{
			rear=rear-1;
			items[rear]=a;
			
		}
	}

	void removefront(type &a)
	{
		if(isempty())
			cout<<"under flow \n";
		else if(front==rear)
		{
			a=items[front];
			front=-1;rear=-1;
		}
		else
		{
			if(front==MAX-1)
			{
				a=items[front];
				front=0;
			}
			else 
				front=(front+1);
		}
	}
	void removerear(type &a)
	{
		if(isempty())
		cout<<"under flow \n";
		else if(rear==front)
		{
			a=items[rear];
			rear=-1;front=-1;
		}
		else
		{
			if(rear==0)
			{
				a=items[rear];
				rear=MAX-1;
			}
			else
				rear=(rear+1)%MAX;
		}
	}
	//type first();
	//type last();
	bool isempty()
	{
		if(front==-1 && rear==-1)
		{
			cout<<"the queue is empty \n";			
			return true;
		}
		else return false;
	}
	bool isfull()
	{
		if(front==0 && rear==MAX-1 || front==rear+1)
		{
			cout<<"the queue is full \n";
			return true;
		}
		else return false;
	}
	void print_que()
	{
		int a=front;
		int b=right;
		if(isempty()){exit(1);}
		if(a<=b)
		{
			while(a<=b)
			{
				cout<<items[a];
				a++;
			}
		}
		else
		{
			while(a<=MAX-1)
			{
				cout<<items[a];
				a++;
			}
			a=0;
			while(a<=b)
			{
				cout<<items[a];
				a++;
			}
		}
	}

};

int main()
{
	int dequeSize;
	cout<<"enter the size of the Queue\n";
	cin>>dequeSize;
	deque<int> D(dequeSize);
	D.insertfront(10);
	D.insertfront(20);
	D.insertfront(30);
	int a;
	D.removefront(a);
	cout<<a<<endl;
	D.removefront(a);
	cout<<a<<endl;
	D.removefront(a);
	cout<<a<<endl;
	int b;
	D.insertrear(1);
	D.insertrear(2);
	D.insertrear(3);
	cout<<"insertion from rear"<<endl;
	D.removerear(b);
	cout<<b<<endl;
	D.removerear(b);
	cout<<b<<endl;
	D.removerear(b);
	cout<<b<<endl;
	
	system("pause");
	return 0;
}