I followed the example of the circular cue in the book, and there are errors depending on the size of the array. Help me.

#include <stdio.h>
#include <stdlib.h>

// ==== Start the circular cue code ====
#define MAX_QUEUE_SIZE 5
typedef int element;
typeef structure { // queue type
    element data[MAX_QUEUE_SIZE];
    int front, rear;
} } QueueType;

// Error function
void error(char *message) {
    fprintf(stderr, "%s\n", message);
    exit(1);
}

// Circular Queue Initialization Function
void init_queue(QueueType *q) {
    q->front = q->rear = 0;
}

// Blank Status Detection Function
int is_empty(QueueType *q) {
    return (q->front == q->rear);       

}

// Saturation detection function
int is_full(QueueType *q) {
    return ((q->rear + 1) % MAX_QUEUE_SIZE == q->front);    
}

// Circular Queue Output Function
void queue_print(QueueType *q) {
    printf("QUEUE(front=%d rear=%d) = ", q->front, q->rear);
    if (!is_empty(q)) { 
        int i = q->front;
        do {
            i = (i + 1) % (MAX_QUEUE_SIZE); 
            printf("%d | ", q->data[i]);
            if (i == q->rear)
                break;
        } } while (i != q->front);
    }
    printf("\n");
}

// Insertion function
void enqueue(QueueType *q, element item) {
    if (is_full(q))
        error ("Queue is saturated");
    q->rear = (q->rear + 1) % MAX_QUEUE_SIZE;
    q->data[q->rear] = item;
}

// Delete function
element dequeque(QueueType *q) {
    if (is_empty(q))
        error ("Queue is blank");
    q->front = (q->front + 1)&MAX_QUEUE_SIZE;
    return q->data[q->front];
}

// Peak function
element peek(QueueType *q) {
    if (is_empty(q))
        error ("Queue is blank");
    return q->data[(q->front + 1) % MAX_QUEUE_SIZE];
}
// ===== Circular Queue Code End =====

int main() {
    QueueType queue;
    int element;

    init_queue(&queue);
    printf("--Add data step--\n");
    while (!is_full(&queue)) {
        printf("Enter an integer");
        scanf_s("%d", &element);
        enqueue(&queue, element);
        queue_print(&queue);
    }

    printf ("Queue is saturated".\n\n");

    printf("--Delete data step--\n");
    while (!is_empty(&queue)) {
        element = dequeque(&queue);
        printf("Ejected Integer: %d\n", element);
        queue_print(&queue);
    }
    printf ("Queue is blank".\n");
    return 0;
}