Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions Data Structures/Stack/c
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@

86 changes: 86 additions & 0 deletions Data Structures/Stack/stack simple progrom.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,86 @@
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
#define max 10
int st[max],top=-1,item,i;
void push();
void pop();
void display();
void main()

{
int ch;
while(1)
{
printf("\n1.\tFor push AN Elememt\n");
printf("2.\tFor pop and element \n");
printf("3.\tFor Display An Element\n");
printf("4. \tFor Exit from prrogram\n");

printf("\n ENTER YOUR 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("\nInvalid Input\n");
}
}
}

void push()
{
if(top==max-1)
{
printf("\n Stack Is overflow\n");
}
else
{
printf("\n enter the number wants to push\n");
scanf("%d",&item);

top++;
st[top]=item;
}
}

void pop()
{
if(top==-1)
{
printf("\n stack is underflow\n");

}
else
{

printf("\n Top item is %d which Deleted from stack",st[top]);
top--;
}
}

void display()
{
if(top>-1)
{

printf("\n Stack\n");
for(i=top;i>-1;i--)
printf("\n %d",st[i]);
}
else
{
printf("\n stack is empty");

}
}