DATA

STRUCTURES
WITH COMPETITIVE
CODING
Presented By: Mr. Satyananda Swain
Assistant Professor, Computer Science Engineering,

SCHOOL OF ENGINEERING AND TECHNOLOGY,

CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 DATA STRUCTURES
Chapter-4: Stack
Presented By: Mr. Satyananda Swain
(Assistant Professor)
DEPARTMENT OF COMPUTER SCIENCE ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY,
BHUBANESWAR, ODISHA
 Introduction: Stack 1

❑ A stack is a linear data structure based on the LIFO(Last

In First Out) principle, in which the insertion of a new
element and removal of an existing element occur at the
same end, represented as the top of the stack.

❑ LIFO(Last In First Out) Principle in Stack Data Structure:

❑ This strategy states that the element inserted last will

come out first. You can take a pile of plates kept on top
of each other as a real-life example. The plate we put
last is on the top, and since we removed the plate at the
top, we can say that the plate placed last comes out
first.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Types of Stack Data Structure 2

❑ Fixed Size Stack: As the name suggests, a fixed size stack has a fixed size and cannot grow or

shrink dynamically. If the stack is full and an attempt is made to add an element, an overflow error

occurs. If the stack is empty and an attempt is made to remove an element, an underflow error

occurs.

❑ Dynamic Size Stack: A dynamic size stack can grow or shrink dynamically. When the stack is full, it

automatically increases its size to accommodate the new element; when the stack is empty, it

decreases. This type of stack is implemented using a linked list, as it allows for easy resizing the

stack.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Basic Operations on Stack Data Structure 3
❑ Certain operations are provided to us to make manipulations in a stack. They are:

▪ push() to insert an element into the stack.

▪ pop() to remove an element from the stack.

▪ top() Returns the top element of the stack.(Pick/Peep)

▪ isEmpty() returns true if the stack is empty else, it is false.

▪ isFull() returns true if the stack is full else, it is false.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Implementation of Stack Data Structure 4

❑ The basic operations that can be performed on a stack include push, pop, and peek. There are two
ways to implement a stack –

▪ Using Array

▪ Using Linked List

❑ In an array-based implementation, the push operation is implemented by incrementing the index of

the top element and storing the new element at that index. The pop operation is implemented by
returning the value stored at the top index and then decrementing the index of the top element.

❑ In a linked list-based implementation, the push operation is implemented by creating a new node
with the new element and setting the next pointer of the current top node to the new node. The pop
operation is implemented by setting the next pointer of the current top node to the next node and
returning the value of the current top node.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Push Operation 5
❑ Push operation adds an item to the stack. If the stack is full,
Step 1: Start.
it is considered an Overflow condition.
Step 2: If (TOP=MASIZE), then:
❑ Algorithm : PUSH_STACK(STACK, TOP, MAXSIZE, ITEM)
Step 2.1) Print “OVERFLOW” and Return.
▪ Here, the STACK is a Linear Array of elements following
the LIFO Principle.
[End of if of Step-2]

▪ TOP is a variable storing the index value of the top

Step 3: Set TOP: = TOP + 1.

element of STACK. Step 4: Set STACK[TOP] : = ITEM.

▪ MAXSIZE is the Maximum number of elements that can Step 5: Stop.

be stored in the STACK.

▪ ITEM is the element to be inserted.

This algorithm is used to insert ITEM onto STACK.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Pop Operation 6
❑ Pop operation removes an item from the stack. The items are

popped in the reversed order in which they are pushed. If the

stack is empty, it is considered an Underflow condition.

Step 1: Start.
❑ Algorithm: POP_STACK (STACK, TOP) Step 2: Let ITEM.

▪ Here, the STACK is a Linear Array of elements following the Step 3: If (TOP=0), then:

LIFO Principle. Step 3.1) Print “UNDERFLOW” and Return.

[End of if of Step-3]
▪ TOP is a variable storing the index value of the top element
Step 4: Set ITEM: = STACK[TOP].
of the STACK.
Step 5: Set TOP: = TOP - 1.
This algorithm is used to delete the TOP element of the STACK and
Step 6: Print “Item Deleted=”, ITEM.
assign it to ITEM.
Step 7: Stop.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Peep/Pick Operation 7

❑ Pick operation returns the top element of the stack. Step 1: Start.

Step 2: Let I.
❑ Algorithm: PEEP_STACK (STACK, TOP)
Step 3: If (TOP=0), then:
▪ Here, the STACK is a Linear Array of elements Step 3.1) Print “Empty Stack” and Return.

following the LIFO Principle. [End of if of Step-3]

Step 4: Repeat For I : = TOP to 1 decremented by 1, then:

▪ TOP is a variable storing the index value of the
Step 4.1) Apply PROCESS/ Print STACK[I].
top element of the STACK.
[End of Loop of Step-4]

This algorithm is used to display all the elements of Step 5: Stop.

STACK in LIFO order.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 isEmpty Operation 8

❑ isEmpty() operation returns true if the stack is empty, else false.

❑ Algorithm for isEmpty Operation:

▪ Check for the value of the top in a stack.

▪ Algorithmically, If (top = 0), then the stack is empty so return

true. Otherwise, the stack is not empty, so return false.

▪ Programmatically, If (top == -1), then the stack is empty so

return true. Otherwise, the stack is not empty, so return

false.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 isFull Operation 9
❑ isFull() operation returns true if the stack is full; otherwise, it

is false.

❑ Algorithm for isFull( ) Operation:

▪ Check for the value of the top in a stack.

▪ Algorithmically, If (top = MAXSIZE), then the stack is full

so return true.

▪ Otherwise, the stack is not full, so return false.

▪ Programmatically, If (top == MAXSIZE-1), then the stack is

full so return true.

▪ Otherwise, the stack is not full, so return false.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Stack Operations: Complete C Code 10

❑ C-CODE typedef struct stack STACK;

//C program to simulate the stack operations. //Function to check whether the stack is empty or not

#include<stdio.h> int is_empty(STACK *s)

#include<process.h> {

#define STACK_SIZE 5 if (s->top==-1)

struct stack return 1; /* Stack empty */

{ else

int items[STACK_SIZE]; return 0; /* Stack is not empty */

int top; }

};

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Stack Operations: Complete C Code 11
//Function to check whether the stack is full or not. {

int is_full(STACK *s) if ( is_full(s) )

{ printf("Stack Overflow\n");

if (s->top==STACK_SIZE-1) else

return 1; /* Stack is full */ {

else s->top++;

return 0; /* Stack is not full */ s->items[s->top] = item;

} }

// Function to insert an integer item into the stack }

void push(int item, STACK *s)

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Stack Operations: Complete C Code 12
// Function to delete an integer item from the stack void display(STACK *s)

void pop(STACK *s) {

{ int i;

int item; if (is_empty(s) )

if ( is_empty(s) ) printf("Stack is empty\n");

printf("Stack Underflow\n"); else

else {

{ printf("The contents of the stack\n");

item = s->items[s->top]; /* Access the top element */ for (i= s->top;i>=0;i --)

s->top--; /* Update the pointer to point to previous item*/ {

printf("Item Deleted:%d",item); printf(" %d\n",s->items[i]);

}} }}}

// Function to display the contents of the stack

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Stack Operations: Complete C Code
13
void main( ) {

{ case 1:

int item, choice; printf("Enter the item to be inserted\n");

STACK s; /* To store items */ scanf("%d",&item);

s.top = -1; /* Stack is empty initially */ push(item, &s);break;

do case 2:pop(&s);break;

{ case 3:display(&s);break;

printf("\n1: Push \n2: Pop\n"); case 4: exit(0);

printf("3: Display \n4: Exit\n"); }

printf("Enter the choice\n"); } while(choice<5);

scanf("%d",&choice); }

switch(choice)
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Applications of Stack 14

❑ Applications of Stack Data Structures

▪ Recursion

▪ Expression Evaluation and Parsing

▪ Depth-First Search (DFS)

▪ Undo/Redo Operations

▪ Browser History

▪ Function Calls

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Recursion 15

❑ The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is
called a recursive function.

❑ A recursive function solves a particular problem by calling a copy of itself and solving smaller subproblems of the
original problems.

❑ Properties of Recursion:

▪ Performing the same operations multiple times with different inputs.

▪ In every step, we try smaller inputs to make the problem smaller.

▪ Base condition is needed to stop the recursion otherwise infinite loop will occur.

❑ Types of Recursions:

Recursion are mainly of two types depending on whether a function calls itself from within itself or more than one
function call one another mutually. The first one is called direct recursion and another one is called indirect recursion.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Recursion 16
❑ How are recursive functions stored in memory?

❑ Recursion uses more memory, because the recursive function adds to the stack with each recursive call, and
keeps the values there until the call is finished. The recursive function uses LIFO (LAST IN FIRST OUT)
Structure just like the stack data structure.

❑ What is the base condition in recursion?

❑ In the recursive program, the solution to the base case is provided and the solution to the bigger problem is
expressed in terms of smaller problems. In this example, the base case for n < = 1 is defined and the
int fact(int n) larger value of a number can be solved by converting to a
{ smaller one till the base case is reached.
if (n < = 1) // base case
return 1; Note: Why Stack Overflow error occurs in recursion?
else If the base case is not reached or not defined, then the stack
return n*fact(n-1); } overflow problem may arise.
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Arithmetic Expression Evaluation 17
❑ Mathematical formulas often involve complex expressions that require a clear understanding of the
order of operations. To represent these expressions, we use different notations, each with its own
advantages and disadvantages. Three common expression notations: infix, prefix, and postfix.

▪ Infix Expressions: Infix expressions are mathematical expressions where the operator is placed
between its operands. For example, the expression “a + b”.

▪ Prefix Expressions (Polish Notation): Prefix expressions are also known as Polish notation, are a
mathematical notation where the operator precedes its operands. In prefix notation, the operator is
written first, followed by its operands. For example, the infix expression “a + b” would be written as “+
a b” in prefix notation.

▪ Postfix Expressions (Reverse Polish Notation): Postfix expressions are also known as Reverse Polish
Notation (RPN), are a mathematical notation where the operator follows its operands. In postfix
notation, operands are written first, followed by the operator. For example, the infix expression “a +
b” would be written as “a b +” in postfix notation.
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Convert Infix expression to Postfix expression 18
❑ Algorithm:
INFIX_TO_POSTFIX_CONVERSION(Q,P,STACK) Step 1: START.
Step 2: Push “ ( ” onto STACK and add a “ ) ” to the end of Q.
▪ Here, Q is an expression in infix Step 3: Scan Q from Left to right and repeat steps 4 to 7 for each
element of Q until the STACK is empty:
notation. Step 4: If an operand is encountered, Add it to P.
Step 5: If a left Parenthesis “ ( ” is encountered, Push it onto STACK.
▪ P is the converted expression in postfix Step 6: If an Operator is encountered, then:
form. A) Repeatedly pop from the STACK and add to P each operator(on the
top of STACK) which has the same precedence as or higher
▪ STACK is the data structure used for precedence than the operator currently encountered.
B) Add the operator to STACK. [end of if of step -6]
conversion.
Step 7 if a right “ )” is encountered, then:
A) Repeatedly pop from STACK and add to P each operator until a
This algorithm is used to convert an
left parenthesis is encountered.
expression in infix form to its equivalent B) Remove the left parenthesis.[End of if of step-7][End of loop of
step - 3]
postfix form.
Step 8: STOP

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Convert Infix expression to Postfix expression 19

❑ Example: Infix expression: K + L - M*N + (O^P) * W/U/V * T + Q

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Evaluation of Postfix expression 20

❑ Algorithm: Step 1: START.

EVALUATION_OF_POSTFIX_EXPRESSION Step 2: Add a “ ) ” at the end of P.

Step 3: Scan P from Left to right and repeat steps 4 and 5 for each
(P,STACK)
element of P until the ) is encountered:
▪ Here, P is the expression in postfix Step 4: If an operand is encountered, Put it on STACK.

form. Step 5: If an Operator is encountered, then:

A) Remove the top two elements of STACK.(Where A is the top element
▪ STACK is the data structure used in and B is the next-to-top element.)
evaluation. B) Evaluate B op A.
C) Place the result of (B) back to STACK.
This algorithm is used to evaluate an
.[End of if of step-5] [end of loop of step-3]
expression in postfix form and finds the Step 6:Set VALE equals to top element of STACK.
VALUE of P. Step 7: STOP

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Evaluation of Postfix expression 21

❑ Example: Postfix expression: 3, 4, *, 2, 5, *, +.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Convert Infix expression to Prefix expression 22

❑ Algorithm: Step 1: START.

Step 2: Push “)” onto STACK and add a “ ( ” to the beginning of Q.
INFIX_TO_PREFIX_CONVERSION(Q,P,STACK) Step 3: Scan Q from Right to Left and repeat steps 4 to 7 for each
element of Q until the STACK is empty:
▪ Here, Q is an expression in infix Step 4: If an operand is encountered, Add it to P.
notation. Step 5: If a left Parenthesis “ ) ” is encountered, Push it onto STACK.
Step 6: If an Operator is encountered, then:
▪ P is the converted expression in A) Repeatedly pop from the STACK and add to P each operator(on the
top of STACK) which has a higher precedence than the operator
postfix form. currently encountered.
B) Add the operator to STACK. [end of if of step -6]
▪ STACK is the data structure used for Step 7 if a right “ (” is encountered, then:
conversion. A) Repeatedly pop from STACK and add to P each operator until a
right parenthesis is encountered.
This algorithm converts an expression in infix B) Remove the right parenthesis.[End of if of step-7]
[End of loop of step - 3]
form to its equivalent prefix form. Step 8: STOP

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Convert Infix expression to Prefix expression 23

❑ Example: Infix expression: K + L - M*N + (O^P) * W/U/V * T + Q

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Evaluation of Prefix expression 24

Step 1: START.
❑ Algorithm:
Step 2: Add a “ ( ” at the beginning of P.
EVALUATION_OF_PREFIX_EXPRESSION(P,STACK)
Step 3: Scan P from right to left and repeat steps 4 and 5 for each
▪ Here, P is the expression in postfix form. element of P until the “ ( “ is encountered:
Step 4: If an operand is encountered, Put it on STACK.
▪ STACK is the data structure used in
Step 5: If an Operator is encountered, then:
evaluation.
A) Remove the top two elements of STACK.(Where A is the top element
This algorithm evaluates an expression in prefix and B is the next-to-top element.)

form and finds the VALUE of P. B) Evaluate A op B.

C) Place the result of (B) back to STACK.
.[End of if of step-5] [end of loop of step-3]
Step 6:Set VALE equal to the top element of STACK.
Step 7: STOP

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Evaluation of Prefix expression 25

❑ Example: Préfix expression: -, +, 2, *, 3, 4, /, 16, ^, 2, 3.

SL. No. Symbol Scanned Stack

1 3 3
2 2 3, 2
3 ^ 2^3=8
4 16 8, 16
5 / 16 / 8 = 2
6 4 2, 4
7 3 2, 4, 3
8 * 2, 3 * 4 = 12
9 2 2, 12, 2
10 + 2, 2 + 12 = 14
11 - 14 – 2 = 12
12 End VALUE = 12
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Processing Function Calls: Stack Application 26
❑ Stack is important in programs that call several functions in succession. Suppose we
have a program containing three functions: A, B, and C. Function A invokes function B,
which invokes function C.

❑ When we invoke function A, which contains a call to function B, its processing will not
be completed until function B has completed its execution and returned. Similarly, for
functions B and C. So we observe that function A will only be completed after function
B and function B will only be completed after function C. Therefore, function A is first
to be started and last to be completed. To conclude, the above function activity
matches the last in first out behavior and can easily be handled using Stack.

❑ The given figure shows that return addresses appear in the Stack in the reverse order
in which the functions were called. After each function is completed, the pop
operation is performed, and execution continues at the address removed from the
Stack. Thus, the stack data structure can optimally handle the program that calls
several functions in succession. Control returns to each function at the correct place,
which is the reverse order of the calling sequence.
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Advantages of Stack 27

❑ Advantages of Stack Data Structure

▪ Simplicity: Stacks are a simple and easy-to-understand data structure, making them suitable for
various applications.

▪ Efficiency: Push and pop operations on a stack can be performed constantly (O(1)), providing efficient
access to data.

▪ Last-in, First-out (LIFO): Stacks follow the LIFO principle, ensuring that the last element added to the
stack is the first one removed. This behavior is useful in many scenarios, such as function calls and
expression evaluation.

▪ Limited memory usage: Stacks only need to store the elements that have been pushed onto them,
making them memory-efficient compared to other data structures.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 Disadvantages of Stack 28

❑ Disadvantages of Stack Data Structure

▪ Limited access: Elements in a stack can only be accessed from the top, making it difficult to retrieve or
modify elements in the middle of the stack.

▪ Potential for overflow: If more elements are pushed onto a stack than it can hold, an overflow error will
occur, resulting in data loss.

▪ Not suitable for random access: Stacks do not allow for random access to elements, making them
unsuitable for applications needing access in a specific order.

▪ Limited capacity: Stacks have a fixed capacity, which can be a limitation if the number of elements that
need to be stored is unknown or highly variable.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA
 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SCHOOL OF ENGINEERING AND TECHNOLOGY, CENTURION UNIVERSITY, BHUBANESWAR, ODISHA