What is Stack ?
Stack is a linear data structure which follows a particular order in which the operations are performed.
The order may be LIFO(Last In First Out) or FILO(First In Last Out).
What is push operation in Stack ?
-Insertion in stack is called as push operation in stack.
-These insertion are done at the top of the stack.
Function for push() function:
void push()
{
struct stack *ptr;
ptr=(struct stack*)malloc(sizeof(struct stack));
printf("Enter Number to insert in Stack\n");
scanf("%d",&ptr->data);
ptr->back=top;
top=ptr;
}
#include< stdio.h>
#include< conio.h>
#include< alloc.h>
struct stack
{
int data;
struct stack *back;
};
struct stack *top;
void create()
{
char ch;
struct stack *ptr,*cpt;
printf("Enter Numbern");
cpt=(struct node*)malloc(sizeof(struct stack));
scanf("%d",&cpt->data);
cpt->back=NULL;
do
{
printf("Enter Number\n");
ptr=(struct stack*)malloc(sizeof(struct stack));
scanf("%d",&ptr->data);
ptr->back=cpt;
cpt=ptr;
printf("Continue(y/n)?\n");
ch=getch();
}while(ch=='y');
top=cpt;
}
void traverse()
{
struct stack *ptr=top;
printf("Stack is :\n");
while(ptr!=NULL)
{
printf("%d ",ptr->data);
ptr=ptr->back;
}
}
void push()
{
struct stack *ptr;
ptr=(struct stack*)malloc(sizeof(struct stack));
printf("Enter Number to insert in Stack\n");
scanf("%d",&ptr->data);
ptr->back=top;
top=ptr;
}
void main()
{
clrscr();
create();
traverse();
push();
traverse();
getch();
}
Enter Number
3
Enter Number
4
Continue(y/n)?
Enter Number
7
Continue(y/n)?
Enter Number
1
Continue(y/n)?
Stack is :
1 7 4 3
Enter Number to insert in Stack
9
Stack is :
9 1 7 4 3