How do I implement a stack in C++?

How do I implement a stack in C++?

To implement a stack in C++, you can use a class with an array or a linked list. Which method would you prefer?

I think I'd like to use a linked list.

Great choice! You can create a Node structure to hold the data and a pointer to the next node. Would you like to see a code example?

Yes, please show me the code!

Here's a simple implementation:

struct Node {
    int data;
    Node* next;
};

class Stack {
    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) throw std::out_of_range("Stack is empty");
        int value = top->data;
        Node* temp = top;
        top = top->next;
        delete temp;
        return value;
    }
};

Would you like to know more about stack operations?