C++ 원형 덱

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

class CircularQueue {
protected:
    int front;
    int rear;
    int data[MAX_QUEUE_SIZE];

public:
    CircularQueue() {
        front = rear = 0;
    }
    void enqueue(int element) {
        if (!isFull()) {
            rear = (rear + 1) % MAX_QUEUE_SIZE;
            data[rear] = element;
        }
    }

    int dequeue() {
        if (!isEmpty()) {
            front = (front + 1) % MAX_QUEUE_SIZE;
        }
        return data[front];
    }

    bool isFull() {
        return (rear + 1) % MAX_QUEUE_SIZE == front;
    }
    bool isEmpty() {
        return front == rear;
    }
    int peek() {
        if (!isEmpty()) {
            return data[(front + 1) % MAX_QUEUE_SIZE];
        }
    }
    void display() {
        int max = front < rear ? rear : rear + MAX_QUEUE_SIZE;
        for (int i = front + 1; i <= max; i++) {
            printf("%2d / ", data[i % MAX_QUEUE_SIZE]);
        }
    }

};

class CircularDeque :public CircularQueue{
public:
    CircularDeque() {}
    void addRear(int element) {
        enqueue(element);
    }
    int deleteFront() {
        return dequeue();
    }
    int getFront() {
        return peek();
    }

    //deque추가기능
    void addFront(int element) {
        if (!isFull()) {
            data[front] = element;
            front = (front - 1 + MAX_QUEUE_SIZE) % MAX_QUEUE_SIZE;
        }
    }

    int deleteRear() {
        if (!isEmpty()) {
            int deletedElement = data[rear];
            rear = (rear - 1 + MAX_QUEUE_SIZE) % MAX_QUEUE_SIZE;
            return deletedElement;

        }
    }

    int getRear() {
        if (!isEmpty()) {
            return data[rear];
        }
    }

    //@Override
    void display() {
        int max = front < rear ? rear : rear + MAX_QUEUE_SIZE;
        for (int i = front + 1; i <= max; i++) {
            printf(" %2d ", data[i % MAX_QUEUE_SIZE]);
        }
    }

};

void main() {
    CircularDeque deque;
}