Queue in C++

queue.cpp

/*Queue in c++
 *(FOR RECORD WORK)
 *Jagadeesh Kotra (github.com/jkotra)
 *Dt: 26.08.2019  */

#include <iostream>

using namespace std;

class Queue{
private:
    int q[5]{};
    const int maxsize = 5;
    int front,rear;
public:
    Queue();
    void insert(int x);
    int delet();
    bool isempty();
    bool isfull();
};

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

void Queue::insert(int x) {
    if (isfull())
        cout << "Queue is full." << endl;
    else {
        rear++;
        q[rear] = x;
    }
}

int Queue::delet() {
    if (isempty())
        cout << "Queue is empty." << endl;
    else {
        front++;
        return q[front];
    }
}

bool Queue::isempty() {
    return front == rear;
}

bool Queue::isfull() {
    return rear == (maxsize-1);
}

int main() {

    Queue q;
    q.insert(10);
    q.insert(20);

    cout << q.delet() << " deleted from queue" << endl;
    cout << q.delet() << " deleted from queue" << endl;

    return 0;
}

/* Output :
 * 10 deleted from queue
 * 20 deleted from queue
 */