C++11: std::queue vs std::stack

What are the main differences between std::queue and std::stack in C++11?

The main difference is that std::queue follows FIFO (First In, First Out) order, while std::stack follows LIFO (Last In, First Out).

Can you give me an example of how to use both in code?

Sure! Here's a simple example:

#include <iostream>
#include <queue>
#include <stack>

int main() {
    std::queue<int> q;
    std::stack<int> s;

    // Using std::queue
    q.push(1);
    q.push(2);
    std::cout << "Queue front: " << q.front() << '\n'; // Outputs 1

    // Using std::stack
    s.push(1);
    s.push(2);
    std::cout << "Stack top: " << s.top() << '\n'; // Outputs 2

    return 0;
}

When would I choose to use one over the other?

Use std::queue when you need to process items in the order they arrive, like in task scheduling. Use std::stack for scenarios where you need to backtrack, like in depth-first search algorithms.

Are there any performance differences between them?

Both std::queue and std::stack have similar performance characteristics, as they are both implemented using underlying containers like deque or list. However, the choice of underlying container can affect performance in specific scenarios.