How do I implement queues and stacks in C++?

How do I implement queues and stacks in C++?

To implement queues and stacks in C++, you can use the Standard Template Library (STL) or create your own classes. Would you like to see examples of both?

Yes, please show me how to implement a stack using a class.

Sure! Here's a simple implementation of a stack using a class:

class Stack {
private:
    std::vector<int> elements;
public:
    void push(int element) {
        elements.push_back(element);
    }
    void pop() {
        if (!elements.empty()) {
            elements.pop_back();
        }
    }
    int top() {
        return elements.back();
    }
    bool isEmpty() {
        return elements.empty();
    }
};

Would you like to see how to implement a queue next?

Yes, how do I implement a queue?

Here's a simple implementation of a queue using a class:

class Queue {
private:
    std::deque<int> elements;
public:
    void enqueue(int element) {
        elements.push_back(element);
    }
    void dequeue() {
        if (!elements.empty()) {
            elements.pop_front();
        }
    }
    int front() {
        return elements.front();
    }
    bool isEmpty() {
        return elements.empty();
    }
};

Let me know if you need further explanations or examples!