C++ Stack Exercises: Delete all occurrences of an item in a stack

Last update on April 14 2025 12:44:42 (UTC/GMT +8 hours)

13. Delete All Occurrences of an Item in an Array-Based Stack

Write a C++ program to delete all occurrences of an item in a stack using arrays.

Test Data:
Input some elements onto the stack:
Stack elements are: 5 2 2 4 7
Remove 2 from the said stack:
Stack elements are: 5 4 7

Sample Solution:

C++ Code:

#include <iostream>

using namespace std;
#define MAX_SIZE 15 // Maximum size of stack

class Stack {
private:
    int top; // Index of top element
    int arr[MAX_SIZE]; // Array to store elements
public:
    Stack() {
        top = -1; // Initialize top index to -1 (empty stack)
    }

    bool push(int x) {
        if (isFull()) {
            cout << "Stack overflow" << endl; // Display message if stack is full
            return false; // Return false to indicate failure in pushing element
        }
        // Increment top index and add element to array
        arr[++top] = x; 
        return true; // Return true to indicate successful element addition
    }

    int pop() {
        if (isEmpty()) {
            cout << "Stack underflow" << endl; // Display message if stack is empty
            return 0; // Return 0 to indicate failure in popping element
        }
        // Return top element and decrement top index
        return arr[top--]; 
    }

    int peek() {
        if (isEmpty()) {
            cout << "Stack is empty" << endl; // Display message if stack is empty
            return 0; // Return 0 to indicate failure in peeking element
        }
        // Return top element without modifying top index
        return arr[top]; 
    }

    bool isEmpty() {
        // Stack is empty if top index is -1
        return (top < 0); 
    }

    bool isFull() {
        // Stack is full if top index is equal to MAX_SIZE - 1
        return (top >= MAX_SIZE - 1); 
    }

    void display() {
        if (top < 0) {
            cout << "Stack is empty" << endl; // Display message if stack is empty
            return;
        }
        cout << "\nStack elements are: ";
        for (int i = top; i >= 0; i--)
            cout << arr[i] << " "; // Display elements of the stack
        cout << endl;
    }

    // Function to delete a specific element from the stack
    void delete_specific_element(Stack& stk, int element);
};

// Function definition to delete a specific element from the stack
void Stack::delete_specific_element(Stack& stk, int element) {
    if (stk.isEmpty()) {
        cout << "Stack is empty." << endl; // Display message if the stack is empty
        return;
    }

    int size = stk.top + 1; // Get the size of the stack
    int temp[size]; // Create a temporary array to store stack elements
    int count = 0; // Initialize count to 0

    // Copy stack elements into a temporary array
    while (!stk.isEmpty()) {
        int current = stk.pop(); // Pop elements from stack
        if (current != element) { // Check if the element matches the specified element
            temp[count++] = current; // Store non-matching elements in temporary array
        }
    }

    // Push non-matching elements back onto the stack
    for (int i = count - 1; i >= 0; i--) {
        stk.push(temp[i]); // Push non-matching elements back onto the original stack
    }
}

int main() {
    Stack stk; 
    cout << "Input some elements onto the stack:";
    stk.push(7);
    stk.push(4);
    stk.push(2);
    stk.push(2);
    stk.push(5);
    stk.display();
    cout << "\nRemove 2 from the said stack:";
    stk.delete_specific_element(stk, 2); // Remove specific element from the stack
    stk.display();
    cout << "\nInput two more elements onto the stack:";
    stk.push(7);
    stk.push(5);
    stk.display();
    cout << "\nRemove 7 from the said stack:";
    stk.delete_specific_element(stk, 7); // Remove specific element from the stack
    stk.display();
    cout << endl;
}

Sample Output:

Input some elements onto the stack:
Stack elements are: 5 2 2 4 7

Remove 2 from the said stack:
Stack elements are: 5 4 7

Input two more elements onto the stack:
Stack elements are: 5 7 5 4 7

Remove 7 from the said stack:
Stack elements are: 5 5 4

Flowchart:

For more Practice: Solve these Related Problems:

• Write a C++ program to remove all instances of a specified value from an array-based stack and display the result.
• Develop a C++ program that scans an array-based stack for a given item and deletes every occurrence of it.
• Design a C++ program to implement an array-based stack and remove a particular element wherever it appears.
• Implement a C++ program that iterates through an array-based stack and deletes all occurrences of a user-defined number.

CPP Code Editor:

Contribute your code and comments through Disqus.

Previous C++ Exercise: Remove duplicates from a stack using arrays.
Next C++ Exercise: K^th element of a stack from top position.