[DataStructure] Queue?

[DataStructure] Queue?

// Queue
// enqueue, dequeue, isEmpty
// generic template class

#include <iostream>
using namespace std;

template <class T>
class Queue {
private:
   T *queue;
   int size;
   int front, back;

public:
   Queue(int size) {
      this->queue = new T[size];
      this->size = size;
      this->front = this->back = 0;
   }

   void enqueue(T item) {
      int pos = this->back++ % size;
      this->queue[pos] = item;
   }

   T dequeue() {
      int pos = this->front++ % size;
      return this->queue[pos];
   }

   bool isEmpty() {
      return this->front == this->back;
   }

   bool isFull() {
      return this->front == (this->back+1) % this->size;
   }
};

#define SIZE 1000000

int main() {

   Queue<int> *q = new Queue<int>(SIZE);

   q->enqueue(3);
   q->enqueue(4);
   q->enqueue(5);

   cout << q->dequeue() << endl;
   cout << q->dequeue() << endl;
   cout << q->dequeue() << endl;

   return 0;
}