Stack using Array in Data Structures using Java

Program 1

package dataflair;
import java.util.*;
public class TestStack 
{
    public static void main(String[] args) 
    {
           int choice;
           Scanner scan=new Scanner(System.in);
           MyStack M=new MyStack();
         do
         {    
          System.out.println("---------------------Stack Menu----------------------");    
          System.out.println("1. Push");
          System.out.println("2. Pop");
          System.out.println("3. Display");
          System.out.println("4. Exit");
          System.out.println("------------------------------------------------------");
          System.out.println("Enter Your Choice"); 
          choice=scan.nextInt();
          switch(choice)
          {
              case 1:M.push();break;
              case 2:M.pop();break;
              case 3:M.display();break;
              case 4:break;
              default:System.out.println("Invalid Choice");
          }
         }while(choice!=4);
         
          
    }
    
}

Program 2

package dataflair;
import java.util.Scanner;
public class MyStack 
{
       
       private int top=-1;
       private final int MAXSIZE=10;
       private int stack[]=new int[MAXSIZE];
       Scanner scan=new Scanner(System.in);
       
         void push()
         {
             int n;
            if(top==MAXSIZE-1)       
                 System.out.println("Stack is Overflow");
            else
            {
                System.out.println("Enter an element for push");
                n=scan.nextInt();
                top++;
                stack[top]=n;
            }
         }
         void pop()
         {
             if(top==-1)
                 System.out.println("Stack is Empty");
             else
             {
                 int n;
                 n=stack[top];
                 top--;
                 System.out.println("Poped element is: "+n);
             }
         }
         void display()
         {
             
             if(top==-1)
                 System.out.println("Stack is empty");
             else
             {
                 System.out.println("Elements of Stack");    
                 for(int i=top;i>=0;i--)
                 {
                     System.out.println(stack[i]);
                 }
             }
         }
}