Stack in DataStructure

#include
#include
#include
int top=-1,count=0;
char stk[10][10];
void push();
void pop();
void display();
int main()
{
int ch;
do{
printf("\n1.Push\n2.pop\n3.Display\n4.Exit\n");
printf("Enter u r choice:\n");
scanf("%d",&ch);
switch(ch)
{
case 1:
push();
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
exit(0);
default:
printf("Enter Correct vale\n");

}
}while(ch!=4);

}
void push()
{
char name[10];
if(top<10)
{
printf("Enter any string:\n");
top++;
count++;
scanf("%s",name);
strcpy(stk[top],name);

}
else
{
printf("stack is full\n");
return;
}

}
void pop()
{
if(top==-1)
{
printf("stack is empty:\n");
}
printf("Elements deletd:%s ",stk[top]);
top--;
count--;


}
void display()
{
int i;
if(top==-1)
{
printf("stack is empty:\n");
}
printf("Items on the stack:\n");
for(i=0;i<=top;i++)
{
printf("%s ",stk[i]);
}
}