How to Pop an Element From a Stack in C++?

Last Updated : 04 Mar, 2024

In C++, stacks are used to store a collection of similar types of data in a Last-In-First-Out (LIFO) manner. In this article, we will discuss how to pop an element from a stack in C++.

Example:

Input:  myStack = {10, 34, 12, 90, 1};    Output:  myStack = {10, 34, 12, 90};

Removing an Element from a Stack in C++

In STL, the std::stack::pop() function is used to remove the top element from the stack. However, it’s important to note that this function does not return the popped element. To access the top element before popping it, we can use the std::stack::top() function.

C++ Program to Pop an Element From a Stack

C++

// C++ Program to pop an element from a stack #include <iostream> #include <stack>  using namespace std;  int main() {     // Creating a stack with elements     stack<int> stackData;      // Pushing elements to the stack     stackData.push(10);     stackData.push(20);     stackData.push(30);     stackData.push(40);      // Printing the original stack before popping     cout << "Before Popping - Original Stack: ";     stack<int> oStack = stackData;     while (!oStack.empty()) {         cout << oStack.top() << " ";         oStack.pop();     }     cout << endl;      // Popping an element from the stack     if (!stackData.empty()) {         stackData.pop();     }      // Printing the updated stack after popping     cout << "After Popping - Updated Stack: ";     while (!stackData.empty()) {         cout << stackData.top() << " ";         stackData.pop();     }     cout << endl;      return 0; }

Output

Before Popping - Original Stack: 40 30 20 10   After Popping - Updated Stack: 30 20 10

Time Complexity: O(1)
Auxiliary Space: O(1)

How to Dequeue an Element from a Queue in C++?

gauravgandal

Improve

Article Tags :

Practice Tags :

In C++ Stacks are a type of container adaptor with LIFO(Last In First Out) type of work, where a new element is added at one end (top) and an element is removed from that end only. In this article, we will learn to push the elements onto a Stack in C++. Example:Input:myStack = {40};Output:myStack: {

2 min read

How to Remove an Element from a List in C++?

In C++, the STL provides a std::list container that represents a doubly linked list to store the sequential data in non-contiguous memory locations. In this article, we will learn how to remove an element from a list in C++. Example: Input: myList = {1, 2, 3, 4, 5, 6, 7, 8} Target = 5 Output: // rem

2 min read

How to Remove an Element from Vector in C++?

In this article, we will learn how to remove a given element from the vector in C++. The most straightforward method to delete a particular element from a vector is to use the vector erase() method. Let's look at a simple example that shows how to use this function: [GFGTABS] C++ #include <bits/s

2 min read

How to Access the Top Element of a Stack in C++?

In C++, The stack is a container adapter that provides a Last-In-First-Out (LIFO) type of data structure in which insertion and deletion are done at the end only. In this article, we will learn how to access the top element of a stack in C++. Example: Input: myStack = {10, 20, 30, 40} Output: Top El

2 min read

How to Dequeue an Element from a Queue in C++?

In C++, queues are a type of container adaptors that operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the front. In this article, we will learn how to dequeue an element from a queue in C++ STL. Example: Input: Create a queue an

2 min read

How to Add an Element at the Front of a List in C++?

In C++, the STL has a doubly linked list container defined as the std::list class template inside the <list> header. It stores the sequential data in non-contiguous memory locations. In this article, we will learn how to add an element at the beginning of a list in C++ STL. Example: Input: myL

2 min read

How to Delete an Element from a Priority Queue in C++ ?

In C++, a priority queue is a queue in which elements are arranged based on their priority values as each element has a priority value associated with it. In this article, we will learn how to delete an element from a priority queue in C++. For Example, Input: myPriorityQueue = {8, 6, 7, 5, 4, 2, 3}

2 min read

How to Remove an Element from the End of a List in C++?

In C++, lists are data structures that allow us to store data of the same type in non-contiguous memory locations. In this article, we will learn how to remove an element from the end of a list in C++. Example Input: myList={10,20,30,40,50} Output: List Elements: 10 20 30 40Delete the Last Element f

2 min read

How to Add an Element to a Set in C++?

In C++ STL, a set is a container that stores unique elements in a sorted order. In this article, we will learn how to add an element to a set in C++ STL. Example: Input: mySet = {1, 2, 4, 5, 8} Element to add: 3 Output: mySet = {1, 2, 3, 4, 5, 8}Add an Element to a Set in C++To add a specific elemen

2 min read

How to Clear a Stack in C++?

In C++, clearing a stack means removing all element from the stack container leaving it empty. In this article, we will learn how to clear a stack in C++. The most efficient method to clear a stack is by assigning the new empty stack to our original stack container. Let's take a look at the code exa

3 min read

How to Pop an Element From a Stack in C++?

Example:

Removing an Element from a Stack in C++

C++ Program to Pop an Element From a Stack

Similar Reads