struct tklijent{
       char ime[20],prez[20];
       int god, stanje;
       char vrsta;
};

struct e{
       tklijent elem;
       e *slj;
};

struct tred{
       e *p, *z;       
};

typedef struct tklijent element;
typedef struct tred Queue;

tred *InitQ(tred *Q){
       e *novi = new e;
       Q = new tred;
       novi -> slj = NULL;
       Q -> z = novi;
       Q -> p = novi;
       return Q;     
};

tklijent FrontQ(tred *Q){
       return Q -> p -> slj -> elem;         
};

void EnQueueQ(element x, tred *Q){
       e *novi = new e;
       novi -> elem = x;
       novi -> slj = NULL;
       Q -> z -> slj = novi;
       Q -> z = novi;
};

void DeQueueQ(tred *Q){
       e *brisi = Q -> p;
       Q -> p = brisi -> slj;
       delete brisi;     
};

bool IsEmptyQ(tred *Q){
       if(Q -> z == Q -> p)
            return true;
       else 
            return false;     
};

Zadatak_3_red_pokazivac_makaniski

C++