![#define N 5;
int stack [N];
int top = -1;
void push()
{
int x;
printf(“Enter data”);
scanf(“%d”, &x);
if(top= =N-1)
printf(“Overflow”);
else
{
top++;
stack[top]=x;
}
}
void pop()
{
int item;
if(top= =-1)
printf(“underflow”);
else
{
item=stack[top];
top--;
printf(“pop element is %d”, item);
}
}
void peek()
{
if(top= =-1)
printf(“underflow”);
else
printf(“%d”, stack[top]);
}
void display()
{
int i;
for(i=top; i >=0;i--)
{
printf(“%d”, stack[i]);
}
}
void main()
{
push();
push();
pop();
peek();
display();}
4
3
2
1
0
stack 5
top=-1
STACK
top
top
int x 10
-1==4, False
20
10
0==4, False
20
int item
1==-1, False
20
garbage
pop element is 20
10
10
0==-1, False
i=0;0>=0,true
i=-1](https://image.slidesharecdn.com/5-220924120936-3e21047d/85/Stack-implementation-using-Array-pptx-5-320.jpg)
Stack implementation using Array.pptx
- 1. DATA STRUCTURES STACK IMPLEMENTATION USING ARRAY Santhiya S Assistant Professor Department of AI Kongu Engineering College
- 2. STACK AS ADT Basic Operations: Insertion from top Deletion from top Push Pop Last in First out (LIFO) or First in Last out (FILO).
- 3. 4 3 2 1 0 Size=5 TOP=-1 (At initially) top++ push(6) insert 6 top-- pop() now there we have garbage value. If you insert next element, it will be overwritten top++ push(3) insert 3 top-- pop() top++ push(5) insert 5 TOP TOP 5 GARBAGE 6 3 push(5) push(6) pop() push(3) pop() STACK WORKING OF STACK
- 4. IMPLEMENTATION OF STACK using Array
- 5. #define N 5; int stack [N]; int top = -1; void push() { int x; printf(“Enter data”); scanf(“%d”, &x); if(top= =N-1) printf(“Overflow”); else { top++; stack[top]=x; } } void pop() { int item; if(top= =-1) printf(“underflow”); else { item=stack[top]; top--; printf(“pop element is %d”, item); } } void peek() { if(top= =-1) printf(“underflow”); else printf(“%d”, stack[top]); } void display() { int i; for(i=top; i >=0;i--) { printf(“%d”, stack[i]); } } void main() { push(); push(); pop(); peek(); display();} 4 3 2 1 0 stack 5 top=-1 STACK top top int x 10 -1==4, False 20 10 0==4, False 20 int item 1==-1, False 20 garbage pop element is 20 10 10 0==-1, False i=0;0>=0,true i=-1