#ifndef QUEUE
#define QUEUE

#define NULL_PTR 0

template <class Element>
struct Node
{
	Element Info;
	Node<Element> *Next;
};

template <class Element>
class Queue
{
public:
	Queue();
	void    Empty();
	int     Size();
	void    Enqueue(Element Add);
	Element Dequeue();

protected:
	Node<Element> *NextOut;
	Node<Element> *LastIn;
	int ElementCount;
};

template <class Element>
Queue<Element>::Queue()
{
	ElementCount = 0;
	NextOut      = NULL_PTR;
	LastIn       = NULL_PTR;
}

template <class Element>
void Queue<Element>::Empty()
{
	while (ElementCount > 0)
		Dequeue();
}

template <class Element>
int Queue<Element>::Size()
{
	return ElementCount;
}

template <class Element>
void Queue<Element>::Enqueue(Element Add)
{
	if (ElementCount == 0)
	{
		NextOut = new Node<Element>;
		LastIn  = NextOut;
	}
	else
	{
		LastIn->Next = new Node<Element>;
		LastIn       = LastIn->Next;
	}
	LastIn->Info = Add;
	LastIn->Next = NULL_PTR;
	ElementCount++;
}

template <class Element>
Element Queue<Element>::Dequeue()
{
	Element Result;
	if (ElementCount != 0)
	{
		Node<Element> *ToDelete;
		ToDelete = NextOut;
		Result   = NextOut->Info;
		NextOut  = NextOut->Next;
		delete ToDelete;
		ElementCount--;
	}
	return Result;
}

#endif