stackpoppush.c

#include<stdio.h>
void push();
void pop();

int stack[100],max,i,top=-1,choice;


int main()
{
    printf("Enter a Max value: \n");
    scanf("%d",&max);
    
    while(1)
    {
    printf("Select the operation: \n");
    printf("1. Push\n");
    printf("2. Pop\n");
    printf("3. Exit\n");
    scanf("%d",&choice);
    
    switch(choice)
    {
        case 1:
          push();
          break;
        
        case 2:
          pop();
          break;
        
        case 3:
          printf("Exiting...");
          return 0;
          
        default:
          printf("Invalid Choice..");
          break;
    }
    }
    return 0;
}


void push()
{
  int val;
  if(top==max-1)
  {
      printf("Overflow...");
  }
  else
  {
      printf("Push the elements into Stack..\n");
      while(top<max)
        {
            top = top+1;
            printf("Enter the %d index value: ",top);
            scanf("%d",&val);
            stack[top]=val;
        }
        printf("\n The elements inside the stack are.. \n");
        for(i=top;i>=0;i--)
        {
            printf("%d\n",stack[i]);
        }
  }
 }

void pop()
{
  if(top==NULL)
  {
      printf("Stack is Empty...");
  }
  else
  {

      top=top-1;
      printf("The element is deleted...\n");
      printf("The elements inside the stack after deletion\n");
      for(i=top;i>0;i--)
      {
          printf("%d\n",stack[i]);
      }
  }
 
}