struct qu {
	   elementtype value;
	   struct qu *next;
};

struct que {
	   struct qu *front, *rear;
};

typedef struct que queue;
typedef struct qu *element;

elementtype FrontQ(queue *Q){
	        if (Q->front==Q->rear)
	           cout << "Red je prazan";
            else
                return ((Q->front)->next)->value;
}

void EnqueueQ(elementtype x, queue *Q){
	 element e = new qu;
	 e->value = x;
	 e->next = NULL;
	 (Q->rear)->next = e;
	 Q->rear = e;
}

void DequeueQ(queue *Q){
	 element e;
	 if (Q->front==Q->rear)
        cout << "Red je prazan";
	 else{
	      e = Q->front;
          Q->front = (Q->front)->next;
          delete e;
     }
}

bool IsEmptyQ(queue *Q){
     if (Q->front==Q->rear)
        return true;
     else
	     return false;
}

void InitQ(queue *Q){
	 element e = new qu;
     Q->front = e;
     Q->rear = e;
     e->next = NULL;
}

Zadatak_3_red_pokazivaci_jakljunic

C++