Queue implementation with Array

queueArray.cpp

//Milad Abbasi
//06-07-2018
//Queue implementation with Array

#include<iostream>
using namespace std; 
#define MAX_SIZE 5

class Queue
{
	int A[MAX_SIZE];
	int front, rear; 
public:
	Queue()
	{
		front = -1; 
		rear = -1;
	}

	bool isEmpty()
	{
		return (front == -1 && rear == -1); 
	}

	bool isFull()
	{
		return (rear+1) % MAX_SIZE == front ? true : false;
	}

	void enqueue(int x)
	{
		if(isFull())
		{
			cout<<"Error: Queue is Full\n";
			return;
		}
		if (isEmpty())
			front = rear = 0; 
		else
		    rear = (rear+1) % MAX_SIZE;

		A[rear] = x;
	}

	void dequeue()
	{
		if(isEmpty())
		{
			cout<<"Error: Queue is Empty\n";
			return;
		}
		else if(front == rear ) 
			rear = front = -1;
		else
			front = (front+1) % MAX_SIZE;
	}

	int peek()
	{
		if(front == -1)
		{
			cout<<"Error: cannot return front from empty queue\n";
			return -1; 
		}
		return A[front];
	}
};