Queue Implementation using array in Java

 Queue implementation in Java hindi

public class queue_ary {
    int front=-1,rear=-1;
    int size=5;
    int[] arr=new int[size];
    public void enqueue(int data){
        if (rear==(size-1)){
            System.out.println("overflow");
        }
        else {
           if (front==-1 && rear==-1){
               front++;
               rear++;
               arr[rear]=data;
           }
           else{
               rear++;
               arr[rear]=data;
           }
        }
    }
    public void dequeue(){
        if (front==-1 && rear==-1){
            System.out.println("empty");
        }
        else{
            for (int i=0;i<rear;i++){
                arr[i]=arr[i+1];
            }
            rear--;
        }
    }
    public void display(){
        if (front==-1 && rear==-1){
            System.out.println("empty");
        }
        for (int i=front;i<=rear;i++){
            System.out.println(arr[i]);
        }
    }
    public void peek(){
        System.out.println(arr[front]);
    }
    public static void main(String[] args) {
        queue_ary qq=new queue_ary();
        qq.enqueue(10);
        qq.enqueue(20);
        qq.enqueue(30);
        qq.enqueue(40);
        qq.enqueue(50);
        qq.display();
        qq.peek();
        System.out.println("******");
        qq.dequeue();
        qq.display();
        qq.peek();
        System.out.println("******");
        qq.dequeue();
        qq.display();
        qq.peek();
    }
}