How do I implement a stack in C++ using the standard library?

How do I implement a stack in C++ using the standard library?

You can use the std::stack class from the C++ Standard Library. Here's a simple example:

#include <iostream>
#include <stack>

int main() {
    std::stack<int> myStack;
    myStack.push(1);
    myStack.push(2);
    myStack.push(3);

    std::cout << "Top element: " << myStack.top() << std::endl;
    myStack.pop();
    std::cout << "Top element after pop: " << myStack.top() << std::endl;
    return 0;
}

What are the main functions of the std::stack class?

The main functions of std::stack include:

• push(): Adds an element to the top of the stack.
• pop(): Removes the top element.
• top(): Returns the top element without removing it.
• empty(): Checks if the stack is empty.
• size(): Returns the number of elements in the stack.

Can I use other data types with std::stack?

Yes, std::stack is a template class, so you can use it with any data type, such as std::stack<std::string> or std::stack<MyClass>.

Are there any limitations to using std::stack?

One limitation is that std::stack does not allow direct access to elements other than the top one. If you need to access elements in the middle, consider using std::deque or std::vector.