How do I implement a stack and queue in C++?

How do I implement a stack and queue in C++?

To implement a stack in C++, you can use a vector or a linked list. Would you like a code example?

Yes, please provide a code example for a stack.

Here's a simple stack implementation using a vector:

#include <iostream>
#include <vector>

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 a queue implementation as well?

Yes, how do I implement a queue?

You can implement a queue using a linked list or a deque. Here's a simple implementation using a linked list:

#include <iostream>
struct Node {
    int data;
    Node* next;
};

class Queue {
private:
    Node* front;
    Node* rear;
public:
    Queue() : front(nullptr), rear(nullptr) {}
    void enqueue(int value) {
        Node* newNode = new Node{value, nullptr};
        if (rear) {
            rear->next = newNode;
        }
        rear = newNode;
        if (!front) {
            front = newNode;
        }
    }
    void dequeue() {
        if (front) {
            Node* temp = front;
            front = front->next;
            delete temp;
        }
    }
    int peek() {
        return front ? front->data : -1;
    }
};

Let me know if you need further assistance!