How can I implement a dynamic stack in C++?

How can I implement a dynamic stack in C++?

To implement a dynamic stack in C++, you can use a linked list or a dynamic array. Which one would you prefer?

I think a linked list would be better. Can you show me how?

Sure! You can create a Node structure and a Stack class. The Node will hold the data and a pointer to the next Node.

What about the push and pop functions?

For push, you create a new Node and adjust the head pointer. For pop, you remove the head Node and return its value.

Can you provide a code example?

Absolutely! Here's a simple implementation:

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

class Stack {
    Node* head;
public:
    Stack() : head(nullptr) {}
    void push(int value) {
        Node* newNode = new Node{value, head};
        head = newNode;
    }
    int pop() {
        if (head == nullptr) throw std::out_of_range("Stack is empty");
        int value = head->data;
        Node* temp = head;
        head = head->next;
        delete temp;
        return value;
    }
};

Let me know if you need further explanation!