C++ Stack Implementation Examples

Can you show me some examples of stack implementation in C++?

Sure! A stack can be implemented using an array or a linked list. Which one would you like to see?

Let's start with the array implementation.

Here's a simple array-based stack implementation:

class Stack {
private:
    int top;
    int maxSize;
    int* stackArray;

public:
    Stack(int size) {
        maxSize = size;
        stackArray = new int[maxSize];
        top = -1;
    }

    void push(int value) {
        if (top < maxSize - 1) {
            stackArray[++top] = value;
        } else {
            std::cout << "Stack Overflow" << std::endl;
        }
    }

    int pop() {
        if (top >= 0) {
            return stackArray[top--];
        } else {
            std::cout << "Stack Underflow" << std::endl;
            return -1;
        }
    }
};

Would you like to see the linked list implementation next?

Yes, please show me the linked list implementation.

Here's a linked list-based stack implementation:

class Node {
public:
    int data;
    Node* next;
};

class Stack {
private:
    Node* top;

public:
    Stack() {
        top = nullptr;
    }

    void push(int value) {
        Node* newNode = new Node();
        newNode->data = value;
        newNode->next = top;
        top = newNode;
    }

    int pop() {
        if (top != nullptr) {
            int value = top->data;
            Node* temp = top;
            top = top->next;
            delete temp;
            return value;
        } else {
            std::cout << "Stack Underflow" << std::endl;
            return -1;
        }
    }
};

Let me know if you need further explanations!