Code: Select all
#define N 2
//int stack[N];
//int head=0;
#include<stdio.h>
void push(int [],int,int,int);
int pop(int *,int,int);
int main()
{
int s,k,stack[N],head=0;
do
{
printf("Give your selection\n");
printf("1.Push\n");
printf("2.Pop\n");
printf("3.Finish\n");
scanf("%d",&s);
switch(s)
{
case 1:
{
printf("give an element to push in the stack:\n");
scanf("%d",&k);
push(stack,N,head,k);
break;
}
case 2:
{
pop(stack,N,head);
//printf("%d\n",pop());
break;
}
}
}
while(s!=3);
}
void push(int mstack,int N,int head,int k)
{
if (head<N)
mstack[head++]=e;
else
printf("STACK IS FULL\n");
}
int pop(int mstack,int N,int head)
{
if(head>0)
return mstack[--head];
else
printf("STACK IS EMPTY\n");
}



