Question

can someone explain this other code line by line

void queueEnqueue(int data)

{

// check queue is full or not

if (capacity == rear) {

printf("\nQueue is full\n");

return;

}

  

// insert element at the rear

else {

queue[rear] = data;

rear++;

}

return;

}

Answer 1

void queueEnqueue(int data)
{
// check queue is full or not
// if rear reaches the capacity than we can say the queue is full
if (capacity == rear) {
// printing error message
printf("\nQueue is full\n");
//returing from function
return;
}
  
// if queue is empty
else {
// than insert the element at rear position
queue[rear] = data;
// than move the rear to next position
rear++;
}
//returing from function
return;
}

Note : Please comment below if you have concerns. I am here to help you

If you like my answer please rate and help me it is very Imp for me