#include<stdio.h>
#include<conio.h>
int stack[10];
int top = -1;
int push(int n);
int pop();
void print();
int main()
{
char ch;
int num;
for(;;)
{
printf("\n************************ OPERATION ON STACK ****************************");
printf("\n1.PUSH\n2.POP\n3.DISPLAY\n0.EXIT");
printf("\nEnter your chpice");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\nEnter number to push");
scanf("%d",&num);
push(num);
break;
case 2: pop();
break;
case 3: print();
break;
case 0: exit(0);
default : printf("\nEnter a valid choice");
}
}
getch();
}
int push( int num)
{
if(top<10)
{
top++;
stack[top]=num;
}
else
printf("Stack is full \n Push is not possible");
}
int pop()
{
int data='\0';
if(top==-1)
printf("\nStack is empty");
else
{
data=stack[top];
top--;
printf("\n deleted element is %d",data);
}
}
void print()
{
int i;
printf("Stack element are....\n");
for(i=0;i<10;i++)
if(stack[i]!='\0')
printf("%d\t",stack[i]);
}
#include<conio.h>
int stack[10];
int top = -1;
int push(int n);
int pop();
void print();
int main()
{
char ch;
int num;
for(;;)
{
printf("\n************************ OPERATION ON STACK ****************************");
printf("\n1.PUSH\n2.POP\n3.DISPLAY\n0.EXIT");
printf("\nEnter your chpice");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\nEnter number to push");
scanf("%d",&num);
push(num);
break;
case 2: pop();
break;
case 3: print();
break;
case 0: exit(0);
default : printf("\nEnter a valid choice");
}
}
getch();
}
int push( int num)
{
if(top<10)
{
top++;
stack[top]=num;
}
else
printf("Stack is full \n Push is not possible");
}
int pop()
{
int data='\0';
if(top==-1)
printf("\nStack is empty");
else
{
data=stack[top];
top--;
printf("\n deleted element is %d",data);
}
}
void print()
{
int i;
printf("Stack element are....\n");
for(i=0;i<10;i++)
if(stack[i]!='\0')
printf("%d\t",stack[i]);
}
No comments:
Post a Comment
Note: only a member of this blog may post a comment.