array/Quexetor.cpp
void enqueue(struct Queue* queue, int item) {
  if(isFull(queue)) return;
  queue->rear = (queue->rear + 1) % queue->capacity;

  queue->array[queue->rear] = item;
  queue->size = queue->size + 1;

  cout << "enqueued to queue" << item << endl;
}
// Function to add an item to the queue.
// It changes rear and size

Function to add an item to the queue.
It changes rear and size
Function to add an item to the queue . It changes rear and size
void enqueue(struct Queue* queue, int item) {
  if(isFull(queue)) return;
  queue->rear = (queue->rear + 1) % queue->capacity;
  queue->array[queue->rear] = item;
  queue->size = queue->size + 1;
  cout << "enqueued to queue" << item << endl;
}
void enqueue ( struct Queue * queue , int item ) { if ( isFull ( queue ) ) return ; queue -> rear = ( queue -> rear + 1 ) % queue -> capacity ; queue -> array [ queue -> rear ] = item ; queue -> size = queue -> size + 1 ; cout << " " << item << endl ; }
Function to add an item to the queue.
Function to add an item to the queue .