dQueue.cpp

/******************************
  	dQueue.cpp
    Auther:Syed Zain Ul hasan
  *****************************/

#include <iostream>
using namespace std;

struct Node

{
	int data;
	Node * next;

};

class dQueue{

	private:
		Node *front,*rare;
	public:

		dQueue(){

			front=rare=NULL;
		}

		void push(int data){

			Node * tmp =new Node();
			tmp->data=data;
			if(rare==NULL){

				front=tmp;
				rare=tmp;

			}else {
				rare->next=tmp;
				rare=tmp;
			}
		}

		void pop(){

			if (rare!=NULL){
				Node *tmp=front;
				front=tmp->next;
				delete tmp;
			}
		}


		void display(){

			Node *tmp=front;

			while(tmp!=NULL){

				cout<<tmp->data<<" ";
				tmp=tmp->next;
			}

		}

};


int main(int argc, char** argv)
{
	dQueue d;
	d.push(2);
	d.push(5);
	d.push(22);
	d.push(25);
	d.push(4);
	d.display();
	cout<<endl;
	d.pop();
	d.pop();
	d.pop();
	d.display();
 	return 0;
}