deque in data structure java

Double-Ended Queue in Data Structure java

public class dequeue_ex {
    int front=-1,rear=-1;
    int size=5;
    int[] myarr=new int[size];
    public void enqueueFront(int data){
        if ((front==0 && rear==(size-1)) || front==rear+1){
            System.out.println("overflow");
        }
        else if (front==-1 && rear==-1){
            front=rear=0;
            myarr[front]=data;
        }
        else if (front==0){
            front=size-1;
            myarr[front]=data;
        }
        else{
            front--;
            myarr[front]=data;
        }
    }
    public void enqueuRear(int data){
        if ((front==0 && rear==(size-1)) || front==rear+1){
            System.out.println("overflow");
        }
        else if (front==-1 && rear==-1){
            front=rear=0;
            myarr[rear]=data;
        }
        else if(rear==size-1){
            rear=0;
            myarr[rear]=data;
        }
        else{
            rear++;
            myarr[rear]=data;
        }
    }
    public void dequeuFront(){
        if (front==-1 && rear==-1){
            System.out.println("underflow");
        }
        else if (front==rear){
            front=-1;
            rear=-1;
        }
        else if(front==size-1){
            System.out.println("deleted element " + myarr[front]);
            front=0;
        }
        else {
            System.out.println("deleted element " + myarr[front]);
            front++;
        }
    }
    public void dequeuRear(){
        if (front==-1 && rear==-1){
            System.out.println("underflow");
        }
        else if (front==rear){
            front=-1;
            rear=-1;
        }
        else if (rear==0){
            System.out.println("deleted element " + myarr[rear]);

            rear=size-1;
        }
        else{
            System.out.println("deleted element " + myarr[rear]);
            rear--;
        }
    }
   public void display(){
        int i;
        for (i=front;i!=rear;i=(i+1)%size){
            System.out.println(myarr[i]);
        }
       System.out.println(myarr[i]);

   }
    public static void main(String[] args) {
        dequeue_ex dqq=new dequeue_ex();
        dqq.enqueueFront(10);
        dqq.enqueueFront(20);
        dqq.enqueueFront(30);
        dqq.display();
        System.out.println("*********");
        dqq.enqueuRear(40);
        dqq.enqueuRear(50);
        dqq.display();
        System.out.println("************");
        dqq.dequeuFront();
        dqq.dequeuFront();
        dqq.display();
        System.out.println("*******");
        dqq.dequeuRear();
        dqq.dequeuRear();
        dqq.display();

    }
}