red_polje.h

#include <iostream>
using namespace std;
 
struct tred{
  tdata element[10000];
  int front, rear;
};
 
int AddOne(int n){
  return((n+1)%10000);
}
 
void InitQ(tred *Q){
  Q->front = 0;
  Q->rear = 9999;
}
 
bool IsEmptyQ(tred *Q){
  if (AddOne(Q->rear) == Q->front) return 1;
  else return 0;
}
tdata FrontQ(tred *Q){
  if(IsEmptyQ(Q)) exit(0);
  else return Q->element[Q->front];
}
 
void EnQueueQ(tdata X, tred *Q){
  if(AddOne(AddOne(Q->rear)) == Q->front)
    cout << "Red je pun." << endl;
  else{
    Q->rear = AddOne(Q->rear);
    Q->element[Q->rear] = X;
  }
}
 
void DeQueueQ(tred *Q){
  if(IsEmptyQ(Q)) cout << "Red je prazan." << endl;
  else Q->front = AddOne(Q->front);
}