#include <iostream>
using namespace std;

struct tlista{
  tdata element;
  tlista *next;
};

struct tred{
  tlista *front, *rear;
};

void InitQ(tred *Q){
  tlista *glava = new tlista;
  glava->next = NULL;
  Q->front = glava;
  Q->rear = glava;
}

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

tdata FrontQ(tred *Q){
  if(IsEmptyQ(Q)) cout << "Red je prazan." << endl;
  else return Q->front->next->element;
}

void EnQueueQ(tdata X, tred *Q){
  tlista *novi = new tlista;
  novi->element = X;
  novi->next = NULL;
  Q->rear->next = novi;
  Q->rear = novi;
}

void DeQueueQ(tred *Q){
  if(IsEmptyQ(Q)) cout << "Red je prazan." << endl;
  else{
    tlista *brisani;
    brisani = Q->front;
    Q->front = Q->front->next;
    delete brisani;
  }
}

dekisanta_Z3_3

red_pokazivac.h

C++