C++ Stack Exercises: Reverse a stack (using an array) elements

C++ Stack: Exercise-4 with Solution

Write a C++ program that reverses the stack (using an array) elements.

Test Data:
Input some elements onto the stack:
Stack elements: 0 1 5 2 4 7
Display the reverse elements of the stack:
Stack elements: 7 4 2 5 1 0

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;
            return false;
        }
        // Increment top index and add element to array
        arr[++top] = x; 
        return true;
    }

    int pop() {
        if (isEmpty()) {
            cout << "Stack underflow" << endl;
            return 0;
        }
        // Return top element and decrement top index
        return arr[top--]; 
    }

    int peek() {
        if (isEmpty()) {
            cout << "Stack is empty" << endl;
            return 0;
        }
        // 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;
        return;
    }
    cout << "\nStack elements: ";
    for (int i = top; i >= 0; i--)
        cout << arr[i] << " ";
    cout << endl;
  }
  
void reverse() {
    int n = top + 1; // Get the number of elements in the stack
    int* tmp = new int[n]; // Create a temporary array to store the reversed elements
    for (int i = 0; i < n; i++) {
        tmp[i] = arr[top--]; // Pop elements from the original stack and store them in the temporary array
    }
    for (int i = 0; i < n; i++) {
        push(tmp[i]); // Push the reversed elements back onto the original stack
    }
    delete[] tmp; // Free the temporary array
}
};

int main() {
	//Initialize the stack stk
    Stack stk; 
    cout << "Input some elements onto the stack:";
    stk.push(7);
    stk.push(4);
    stk.push(2);
    stk.push(5);
    stk.push(1);
    stk.push(0);
    // Reverse the elements of the stack
    stk.display(); 
    stk.reverse();
    cout << "Display the reverse elements of the stack:";
    stk.display(); 
    cout << "\nRemove two elements:";
    stk.pop();
    stk.pop();
    stk.display(); 
    cout << "\nInput two more elements";
    stk.push(-1);
    stk.push(10);
    stk.display();
    stk.reverse();
    cout << "Display the reverse elements of the stack:";
    stk.display(); 
    cout << endl;
    return 0;
}

Sample Output:

Input some elements onto the stack:
Stack elements: 0 1 5 2 4 7 
Display the reverse elements of the stack:
Stack elements: 7 4 2 5 1 0 

Remove two elements:
Stack elements: 2 5 1 0 

Input two more elements
Stack elements: 10 -1 2 5 1 0 
Display the reverse elements of the stack:
Stack elements: 0 1 5 2 -1 10 

Flowchart:

CPP Code Editor:

Contribute your code and comments through Disqus.

Previous C++ Exercise: Sort a stack using another stack.
Next C++ Exercise: Average value of the stack elements (using an array).