#include<iostream>
#include<cstring>
using namespace std;
typedef int element;
struct red{
       char ime_prezime[30];
       int g_rodenja;
       float stanje_racun;
       char transakcija[20];
       };
struct ttred{
       red r[1000];
       ttred *sljedeci;
       };
struct tred{
       ttred *front;
       ttred *rear;
       };
ttred tr;
red r;
typedef struct red queue;
queue* FrontQ(tred *td){
     td=new tred;
     td->front->sljedeci=NULL;
     return td->front->sljedeci->r;
     }

int EnQueueQ(char ip[],int g,float sr,char tr[],tred *ta){
    ta=new tred;
    ta->rear->sljedeci=NULL;
    strcpy(ta->rear->r->ime_prezime,ip);
    ta->rear->r->g_rodenja=g;
    ta->rear->r->stanje_racun=sr;
    strcpy(ta->rear->r->transakcija,tr);
}
int DeQueueQ(tred *td){
    ttred *brisi;
    brisi=td->front;
    td->front->sljedeci=td->front;
    delete brisi;
    cout << "Prvi element je izbrisan iz reda!" << endl;
}

bool IsEmptyQ(tred *td){
     if(td->front->sljedeci==NULL)return true;
     else return false;
     }
int InitQ(tred *td){
    td->front=NULL;
    td->rear=NULL;
    cout << "Red je prazan!" << endl;
}

RED_strukture_podataka

C++