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 items[STACKSIZE]; /*array to store the stack elements*/ }
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; :
Stack Initialisation
Alternatively you can use the following
function: void StackInitialize(STACK *Sptr) { Sptr->top=-1; }
Push Operation
Push an item onto the top of the stack (insert an item)
Void push (Stack *, type 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 (STACK *, type newItem)
void push(STACK *Sptr, int ps) /*pushes ps into stack*/ {
if(Sptr->top == STACKSIZE-1){ printf("Stack is full\n"); return; /*return back to main function*/
} else {
Sptr->top++; Sptr->items[Sptr->top]= ps; Sptr->count++;
} }
Pop operation
Pop an item off the top of the stack (delete
an item)
type pop (STACK *)
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.
Type pop(STACK *Sptr)
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; } }
void pop(STACK *Sptr, int *pptr)
void pop(STACK *Sptr, int *pptr) { if(Sptr->top == -1){
printf("Stack is empty\n"); return;/*return back*/
} else {
*pptr = Sptr->items[Sptr->top]; Sptr->top--; Sptr->count--;
} }
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 typedef struct{ int count; int top; int items[STACKSIZE]; /*stack can contain up to 10 integers*/ }STACK; void push(STACK *, int); int pop(STACK *); int main() { int p, i; STACK s; 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 the %d stack items\n",STACKSIZE); for(i=0;i<= STACKSIZE-1;i++){ scanf("%d",&p); push(&s,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; } }
