- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Applications of Stack in Data Structure
The Stack is Last In First Out (LIFO) data structure. This data structure has some important applications in different aspect. These are like below −
- Expression Handling −
Infix to Postfix or Infix to Prefix Conversion −
The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.
Postfix or Prefix Evaluation −
After converting into prefix or postfix notations, we have to evaluate the expression to get the result. For that purpose, also we need the help of stack data structure.
Backtracking Procedure −
Backtracking is one of the algorithm designing technique. For that purpose, we dive into some way, if that way is not efficient, we come back to the previous state and go into some other paths. To get back from current state, we need to store the previous state. For that purpose, we need stack. Some examples of backtracking is finding the solution for Knight Tour problem or N-Queen Problem etc.
- Another great use of stack is during the function call and return process. When we call a function from one other function, that function call statement may not be the first statement. After calling the function, we also have to come back from the function area to the place, where we have left our control. So we want to resume our task, not restart. For that reason, we store the address of the program counter into the stack, then go to the function body to execute it. After completion of the execution, it pops out the address from stack and assign it into the program counter to resume the task again.
- Related Questions & Answers
- Stack Data Structure in Javascript
- Differences between stack and queue data structure
- Rectangle Data in Data Structure
- What are the applications of data mining?
- Applications of DFS and BFS in Data Structures
- Stack ADT in Data Structures
- Halfedge data structure
- Deaps in Data Structure
- Quadtrees in Data Structure
- Data Memory Structure of Intel 8051
- Data memory structure of 8051 Microcontroller
- Comparison of Search Trees in Data Structure
- Optimality of Splay Trees in Data Structure
- Array of Arrays Representation in Data Structure
- Data Structures Stack Primitive Operations