#include <iostream>
using namespace std;

struct zadatak{
  char pre_ime[30], transakcija[20];
  int god_rod;
  float stanje;
};
typedef zadatak element;
struct tred{
  element R;
  tred *sljedeci;
};
struct tredt{
  tred *celo, *zacelje;
};
typedef struct tredt red;
typedef struct tred *elementi;
element FrontQ(red *r){
  if(r -> celo != r -> zacelje) return(r -> celo -> sljedeci -> R);
  else{
    cout << "Red je prazan!\n";
    exit(0);
  }
}
void EnQueueQ(element b, red *r){
  tred *novi = new tred;
  novi -> R = b;
  novi -> sljedeci = NULL;
  r -> zacelje -> sljedeci = novi;
  r -> zacelje = novi;
}
elementi Z;
element DeQueueQ(red *r){
  if(r -> celo != r -> zacelje){
    Z = r -> celo;
    r -> celo = r -> celo -> sljedeci;
  }
  else{
    cout << "Red je prazan!\n";
    exit(0);
  }
}
int IsEmptyQ(red *r){
  if(r -> celo == r -> zacelje) return 1;
  else return 0;
}
red *InitQ(red *r){
  r = new red;
  tred *novi = new tred;
  r -> celo = novi;
  r -> zacelje = novi;
  novi -> sljedeci = NULL;
  return r;
}

red_pokazivac.h

C++