// Queue.cpp: implementation of the Queue class.
//
//////////////////////////////////////////////////////////////////////

#include "stdafx.h"
#include "Queue.h"
#include "stdlib.h"

//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////

Queue::Queue()
{
	LNode *s = new LNode;
	front=s;
	rear=s;
	front->next=NULL;
}

Queue::~Queue()
{
	QueuePtr p;
	while(front)
	{
		p=front;
		front=front->next;
		delete p;
	}
}

void Queue::insert_queue(int a)
{
	LNode *s = new LNode;
	s->data=a;
	s->next=NULL;
	rear->next=s;
	rear=s;
}

void Queue::output_queue()
{
	QueuePtr p=front->next;
	while(p!=NULL)
	{
		cout<<p->data<<"  ";
		p=p->next;
	}
	cout<<"\n";

}

void Queue::delete_queue()
{
	QueuePtr p;
	p=front->next;
	if(p==NULL)	{delete p;  exit;}
	front->next=p->next;
	if(rear==p)  rear=front;
	delete p;
}

int Queue::get_queue()
{
	return front->next->data;
}