Stack implementation in C++ Last Updated : 27 May, 2024 Comments Improve Suggest changes Like Article Like Report Stack is the fundamental data structures used in the computer science to the store collections of the objects. It can operates on the Last In, First Out (LIFO) principle where the most recently added the object is the first one to be removed. It can makes the stacks highly useful in the situations where you to the reverse a series of the operations or repeatedly undo operations. In this article, we will learn how to implement the stack data structure in C++ along with the basic stack operations. Stack Data Structure in C++A stack can be visualized as the vertical stack of the elements, similar to the stack of the plates. We can only add or remove the top plate. Similarly, in the stack data structures, elements can added to and removed from the top of the stack. Stacks can be implemented using the arrays or linked lists: Array-based implementation: It can uses the simple array to the store the elements of the stack. The pointer is used to the keep of the top of the stack.Linked List based implementation: Each element in the stack is the node in a linked list. The top of the stack is simply the head of the linked list.Basic Operations on Stack in C++Following are some basic operations in the stack that make it easy to manipulate the stack data structure: Operation Description Time Complexity Space Complexity Push Add the element to the top of the stack. O(1) O(1) Pop Remove the element on the top of the stack. O(1) O(1) Peek Returns the element at the top of the stack without removing it. O(1) O(1) IsEmpty Checks if the stack is empty. O(1) O(1) C++ Program for the Implementation of StackThis example that implements the stack using arrays and demonstrates the basic stack operations: C++ #include <iostream> using namespace std; // Define Stack class class Stack { private: // Index of the top element in the stack int top; // Array to store stack elements, with a capacity of 100 // elements int arr[100]; public: // Constructor to initialize an empty stack Stack() { top = -1; } // Function to add an element x to the top of the stack void push(int x) { // If the stack is full, print "Stack overflow" and // return if (top >= 99) { cout << "Stack overflow" << endl; return; } // Add element to the top of the stack and increment // top arr[++top] = x; cout << "Pushed " << x << " to stack\n"; } // Function to remove the top element from the stack int pop() { // If the stack is empty, print "Stack underflow" // and return 0 if (top < 0) { cout << "Stack underflow" << endl; return 0; } // Remove the top element from the stack and // decrement top return arr[top--]; } // Function to return the top element of the stack int peek() { // If the stack is empty, print "Stack is empty" and // return 0 if (top < 0) { cout << "Stack is empty" << endl; return 0; } // Return the top element of the stack return arr[top]; } // Function to check if the stack is empty bool isEmpty() { // Return true if the stack is empty (i.e., top is // -1) return (top < 0); } }; // Main function int main() { // Create a stack Stack s; // Push elements into the stack s.push(10); s.push(20); s.push(30); // Print the top element of the stack cout << "Top element is: " << s.peek() << endl; // Print all elements in the stack cout << "Elements present in stack : "; // While the stack is not empty while (!s.isEmpty()) { // Pop the top element from the stack and print it cout << s.pop() << " "; } return 0; } OutputPushed 10 to stack Pushed 20 to stack Pushed 30 to stack Top element is: 30 Elements present in stack : 30 20 10 Applications of the Stack in C++It can applies on the Expression Evaluation and it can evaluates the prefix, postfix and infix expressions.It can applies on the Function calls and recursion.It can applies in text editors for undo mechanisms functionalities.It can applies on syntax parsing and syntax checking. Comment More infoAdvertise with us Next Article Stack implementation in C++ M maheshkadambala Follow Improve Article Tags : C++ CPP-DSA misc-cpp Practice Tags : CPP Similar Reads Implementation of Stack Using Array in C A stack is a linear data structure that follows the Last In First Out (LIFO) principle. This means that the most recently added element is the first one to be removed. In this article, we will learn how to implement a stack using an array in C. Implementation of Stack Using Arrays in CIn the array-b 5 min read Implement a Stack in C Programming Stack is the linear data structure that follows the Last in, First Out(LIFO) principle of data insertion and deletion. It means that the element that is inserted last will be the first one to be removed and the element that is inserted first will be removed at last. Think of it as the stack of plate 7 min read Implementation of stack using Doubly Linked List Stack and doubly linked lists are two important data structures with their own benefits. Stack is a data structure that follows the LIFO (Last In First Out) order and can be implemented using arrays or linked list data structures. Doubly linked list has the advantage that it can also traverse the pr 14 min read stack emplace() in C++ STL Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, where a new element is added at one end (top) and an element is removed from that end only. stack::emplace() This function is used to insert a new element into the stack container, the new element is added on top o 3 min read Implementing Stack Using Class Templates in C++ The task is to implement some important functions of stack like pop(), push(), display(), topElement(), isEmpty(), isFull() using class template in C++. Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or 5 min read Implement Stack using Array Stack is a linear data structure which follows LIFO principle. To implement a stack using an array, initialize an array and treat its end as the stack’s top. Implement push (add to end), pop (remove from end), and peek (check end) operations, handling cases for an empty or full stack.Step-by-step ap 10 min read How to implement a Stack using list in C++ STL In this article, we will discuss how to implement a Stack using list in C++ STL. Stack is a linear data structure which follows. LIFO(Last In First Out) or FILO(First In Last Out). It mainly supports 4 major operations:1. Push: Push an element into the stack.2. Pop: Removes the element by following 3 min read Stack Frame in Computer Organization Stack Frame :Stack is one of the segments of application memory that is used to store the local variables, function calls of the function. Whenever there is a function call in our program the memory to the local variables and other function calls or subroutines get stored in the stack frame. Each fu 3 min read Basic Operations in Stack Data Structure with Implementations In order to make manipulations in a stack, there are certain operations provided to us for Stack, which include:push() to insert an element into the stackpop() to remove an element from the stacktop() Returns the top element of the stack.isEmpty() returns true if the stack is empty else false.size() 13 min read C++ Program to Implement Stack using array Stack is the fundamental data structure that can operates the under the Last In, First Out (LIFO) principle. This means that the last element added to the stack is the first one to be removed. Implementing the stack using the array is one of the most straightforward methods in the terms of the both 4 min read Like