What are stacks in C++ and how do they work?

What are stacks in C++ and how do they work?

Stacks are a type of data structure that follows the Last In First Out (LIFO) principle. You can think of it like a stack of plates; the last plate added is the first one to be removed.

Can you explain how to implement a stack in C++?

Sure! You can implement a stack using an array or a linked list. Would you like to see an example using an array?

Yes, please provide an example using an array.

Here's a simple 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;
        }
    }

    int pop() {
        if (top >= 0) {
            return stackArray[top--];
        }
        return -1; // Stack is empty
    }
};

This code defines a simple stack class with push and pop methods.

What are the common operations performed on a stack?

The common operations on a stack include:

1. Push: Add an item to the top of the stack.
2. Pop: Remove the item from the top of the stack.
3. Peek: View the top item without removing it.
4. isEmpty: Check if the stack is empty.