(C++) (VISUAL STUDIO)

Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. In a normal Queue, we can insert elements until queue becomes full. But once queue becomes full, we cannot insert the next element even if there is a space in front of queue.

Efficiently implement a queue class using a circular array. You may use a vector

(rather than a primitive array) as the underlying array structure.

template

class Queue {

private:

vector