pokazivac-red

struct trojka {
  int xi, yi, zi;
  int d;
};
 
struct RED{
  trojka el;
  RED *next;
};
 
struct Queue{
  RED *front, *rear;
};
 
 
bool IsEmptyQ(Queue *red1){
  if (red1->front == red1->rear)
  {
    return true;
  }
  else
  {
    return false;
  }
}
 
void DeQueueQ (Queue *red1){
  if (!IsEmptyQ(red1)) {
    RED *red2 = red1->front;
    red1->front = (red1->front)->next;
    delete red2;
  }
}
 
trojka FrontQ (Queue *red1){
  if (!IsEmptyQ(red1)) {
    RED *pok = (*red1).front;
    pok = (*pok).next;
    trojka vrijednost = (*pok).el;
    return vrijednost;
  }
}
 
void InitQ (Queue *red1){
  RED *red2 = new RED;
  red2->next = 0;
  red1->front = red2;
  red1->rear = red2;
}
 
void EnQueueQ (trojka x, Queue *red1){
  RED *red2 = new RED;
  (red1->rear)->next = red2;
  red2->el = x;
  red1->rear = red2;
}