Stack data structure

1. /*********** @author: Er. Ganesh Ram Suwal ***********/
/*********** stack program ***********/
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define MAXSIZE 5
int stack[MAXSIZE],data,top=-1;
void push();
void pop();
void display();
void main()
{
int choice;
start:
printf("*** stack operation ****n");
printf("1: push operationn");
printf("2: pop operationn);
printf("3: displayn);
printf("4: exitn);
printf("enter your choice = ");
scanf("%d",&choice);
switch(choice)
{
case 1:push();
break;
case 2:pop();
break;
case 3:display();
break;
case 4:exit(0);
break;
default:printf("*** invalid choice !!! try again ***");
break;
}
goto start;
getch();
}
void push()
{
if(top== MAXSIZE -1)
{
printf("n************************************n");
printf("stack overflow");
printf("n************************************n");
}
else
{
printf("n************************************n");
printf("enter data : ");
scanf("%d",&data);
top++;
stack[top]=data;
printf("************************************n");
}
}
void pop()

2. {
if(top == -1)
{
printf("n************************************n");
printf("stack underflow");
printf("n************************************n");
}
else
{
data = stack[top];
printf("n************************************n");
printf("the pop element = %d",data);
printf("n************************************n");
top--;
}
}
void display()
{
int i;
printf("the content of stack : ");
if(top==-1)
{
printf("n************************************n");
printf("the stack is empty");
printf("n************************************n");
}
else
{
printf("n************************************n");
for(i=0;i<=top;i++)
{
printf("%dt",stack[i]);
}
printf("n************************************n");
}
}

3. Output: