#include <iostream>
using namespace std;
struct que {
	tklijent klijent;
    que *next;
};
struct red {
    que *front,*rear;
};

typedef struct que *element;

tklijent FrontQ(red *Q) {
	if (Q->front==Q->rear) {
        cout << "Red je prazan" << endl;
        exit(0);
     }
     else
         return(Q->front->next->klijent);
}
void EnQueueQ(tklijent x,red *Q) {
	element e;
    e = new que;
    e->klijent=x;
    e->next=NULL;
    Q->rear->next=e;
    Q->rear=e;
}

void DeQueueQ(red *Q) {
	element e;
	if (Q->front==Q->rear) {
        cout << "Red je prazan" << endl;
	  exit(0);
     }
	else {
	     e=Q->front;
          Q->front=Q->front->next;
          free(e);
     }
}

void InitQ(red *Q) {
	element e;
    e = new que;
    Q->front=e;
    Q->rear=e;
    e->next=NULL;
}

int IsEmptyQ(red *Q){
     if (Q->front==Q->rear)
         return(-1);
     else
	   return(0);
}

SP_Z3_red_pokazivac.h_jz.cpp

C++