#include "classes.h"

void queue :: insert (node *element)
{
	q_node *p = new q_node;
	p->info = element;
	p->next = NULL;
	
	if (front == NULL)
		front = p;
	else
		rear->next = p;
	rear = p;
}

node * queue :: remove (void)
{
	q_node *p = front;
	node *ret_value;
	
	if (p == NULL)
		return NULL;
	ret_value = p->info;
	
	if (front == rear)
		rear == NULL;
	front = front->next;
	delete p;
	
	return ret_value;
}

bool queue::isempty (void)
{
	if (front == NULL)
		return true;
	else
		return false;
}