struct qu {
   elementtype value;
   struct qu *next;
};
 
struct que {
   struct qu *front,*rear;
};
 
typedef struct que queue;
typedef struct qu *element;
 
bool IsEmptyQ(queue *element){
	if (element->rear == element->front) return true;
	else return false;
}
 
elementtype FrontQ(queue *element){
	if (IsEmptyQ(element)){
		cout << "Red je prazan!" << endl;
	}
	return element->front->next->value;
}
 
void EnQueueQ(elementtype x , queue *element){
	element novi , prethodni;
	novi = new qu;
	novi->value = x;
	prethodni = element->rear;
	prethodni->next = novi;
	element->rear = novi;
}
 
void DeQueueQ(queue *element){
	if (IsEmptyQ(element)){
		cout << "Red je prazan!" << endl;
		exit(1);
	}
	element brisi;
	brisi = element->front;
	element->front = brisi->next;
	delete(brisi);
}
 
void InitQ(queue *element){
	element el;
	el = new qu;
	el->next = NULL;
	element->front = element->rear = el;
}