Scribd
Upload
31 views19 pages

Stacks 1

The document defines and describes stacks and their implementation using arrays. It explains that a stack is a data structure where elements are added and removed from the top in LIFO (Last In First Out) order. Basic stack operations like push, pop, isEmpty and isFull are described. An array implementation of stacks is presented using a top pointer and array to store elements. Functions for initializing an empty stack, pushing elements onto the stack, and popping elements off the stack are demonstrated.

Uploaded by

Dr. VASAVI BANDE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
31 views19 pages

Stacks 1

The document defines and describes stacks and their implementation using arrays. It explains that a stack is a data structure where elements are added and removed from the top in LIFO (Last In First Out) order. Basic stack operations like push, pop, isEmpty and isFull are described. An array implementation of stacks is presented using a top pointer and array to store elements. Functions for initializing an empty stack, pushing elements onto the stack, and popping elements off the stack are demonstrated.

Uploaded by

Dr. VASAVI BANDE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

Stacks

EENG212 –Algorithms and Data Structures

EASTERN MEDITERRANEAN UNIVERSITY


Stacks
 Outline
 Stacks
 Definition
 Basic Stack Operations
 Array Implementation of Stacks
What is a stack?

 It is an ordered group of homogeneous items of elements.


 Elements are added to and removed from the top of the stack
(the most recently added items are at the top of the stack).
 The last element to be added is the first to be removed (LIFO:
Last In, First Out).
BASIC STACK OPERATIONS
 Initialize the Stack.
 Pop an item off the top of the stack (delete an
item)
 Push an item onto the top of the stack (insert
an item)
 Is the Stack empty?
 Is the Stack full?
 Clear the Stack
 Determine Stack Size
Array Implementation of the Stacks
 The stacks can be implemented by the use of
arrays and linked lists.
 One way to implement the stack is to have a
data structure where a variable called top
keeps the location of the elements in the stack
(array)
 An array is used to store the elements in the
stack
Stack Definition
struct STACK{
int count; /* keeps the number of elements in
the stack */
int top; /* indicates the location of the top of
the stack*/
int a[STACKSIZE]; /*array to store the
stack elements*/
}s;
Stacks
Stack Initialisation
 initialize the stack by assigning -1 to the top
pointer to indicate that the array based stack
is empty (initialized) as follows:
 You can write following lines in the main
program:
:
STACK s;
s.top = -1;
:
Push Operation
Push an item onto the top of the stack (insert an item)
void push (int newitem)
 Function: Adds newitem to the top of
the stack.
 Preconditions: Stack has been
initialized and is not full.
 Postconditions: newItem is at the top of
the stack.
void push (int newitem)
void push(int newitem) /*pushes ps into stack*/
{
if(s.top == STACKSIZE-1){
printf("Stack is full\n");
return; /*return back to main function*/
}
else {
s.top++;
s.a[top]= newitem;
s.count++;
}
}
Pop operation
 Pop an item off the top of the stack (delete
an item)
int pop ()
 Function: Removes topItem from stack and
returns with topItem
 Preconditions: Stack has been initialized and
is not empty.
 Postconditions: Top element has been
removed from stack and the function returns
with the top element.
int pop()
int pop()
{
int element;
If(s.a[top] == -1){
printf("Stack is empty\n");
return;/*return back*/
}
else {
element=s.a[top];
s.top--;
s.count--;
return element;
}
}
EXAMPLE
 The following program implements stack of
size 10 using array representation.
 The 10 elements entered by the user are
pushed into the stack and then the elements
are popped back and displayed.
#include<stdio.h>
#include<stdlib.h>
#define STACKSIZE 10
struct stack{
int count;
int top;
int a[STACKSIZE]; /*stack can contain up to 10 integers*/
}s;
void push(int);
int pop();
int main()
{
int p, i;
s.top = -1; /*indicates that the stack is empty at the beginning*/
s.count = 0; /* 0 items are in the stack*/
/*reading and pushing items into the stack*/
printf("Enter an element to the stack”);
scanf("%d“,&p);
push(p);
}
/*popping and printing the items in the stack*/
printf("\n\nStack contains the following items\n");
for(i=0;i<= STACKSIZE-1;i++){
p=pop(&s);
printf("%d\t",p);
}
return 0;
}
void push(STACK *Sptr, int ps) /*pushes ps into stack*/
{
if(Sptr->top == STACKSIZE-1){
printf("Stack is full\n");
printf("There are %d items in the stack\n", Sptr-
>count);
return; /*return back to main function*/
}
else {
Sptr->top++;
Sptr->items[Sptr->top]= ps;
Sptr->count++;
}
}
int pop(STACK *Sptr)
{
int pp;
if(Sptr->top == -1){
printf("Stack is empty\n");
return -1 /*exit from the function*/
}
else {
pp = Sptr->items[Sptr->top];
Sptr->top--;
Sptr->count--;
return pp;
}
}

You might also like