C++ 선형 큐

#include <cstdio>
#include <cstdlib>
const int MAX_QUEUE_SIZE = 100;

class Queue {
private:
    int front;
    int rear;
    int data[MAX_QUEUE_SIZE];

public:
    Queue() {
        front = rear = -1;
    }

    void enquque(int element) {
        if (front != -1) {
            for (int i = 0; i < rear; i++) {
                data[i] = data[i + front + 1];
            }
            rear -= front + 1;
            front = -1;
        }
        if (!isFull()) {
            data[++rear] = element;
        }
    }

    void dequeue() {
        if (!isEmpty()) {
            front++;
        }
    }
    bool isFull() {
        return rear == MAX_QUEUE_SIZE - 1;
    }
    bool isEmpty() {
        return rear == front;
    }

    void display() {
        for (int i = front + 1; i <= rear; i++) {
            printf("%2d ", data[i]);
        }
    }

};

void main() {
    Queue queue;
}