Queue C++

#include<iostream>
using namespace std;
 
class Queue
{
private:
    int size;
    int front;
    int rear;
    int* q;
public:
    Queue()
    {
        size = 10;
        front = rear = -1;
        q = new int[size];
    }
    Queue(int size)
    {
        this->size = size;
        front = rear = -1;
        q = new int[this->size];
    }
    void enqueue(int x);
    int dequeue();
    void Display();
};
 
void Queue::enqueue(int x)
{
    if (rear == size - 1)
        cout << "full queue";
    else
    {
        q[++rear] = x;
    }
}
 
int Queue::dequeue()
{
    int x = -1;
    if (front == rear)
        cout << "empty";
    else
    {
        x = q[++front];
    }
    return x;
}
 
void Queue::Display()
{
    for (int i = front + 1; i <= rear; i++)
    {
        cout << q[i] << " ";
    }
}
 
 
int main()
{
    Queue q(5);
    q.enqueue(1);
    q.enqueue(2);
    q.enqueue(3);
    cout << q.dequeue();
    q.Display();
    return 0;
}