What are the applications of stack and queue in C++?

What are the applications of stack and queue in C++?

Stacks and queues are fundamental data structures in C++. Stacks are used in function calls, expression evaluation, and backtracking algorithms. Queues are used in scheduling tasks, breadth-first search, and managing resources.

Can you give me an example of using a stack in C++?

Sure! Here's a simple example of using a stack to reverse a string in C++:

#include <iostream>
#include <stack>
#include <string>

int main() {
    std::stack<char> s;
    std::string str = "Hello";

    for (char c : str) {
        s.push(c);
    }

    while (!s.empty()) {
        std::cout << s.top();
        s.pop();
    }
    return 0;
}

This code pushes each character of the string onto the stack and then pops them off to print in reverse order.

What about a queue? Can you show me an example?

Absolutely! Here's an example of using a queue to implement a simple task scheduler in C++:

#include <iostream>
#include <queue>
#include <string>

int main() {
    std::queue<std::string> tasks;
    tasks.push("Task 1");
    tasks.push("Task 2");
    tasks.push("Task 3");

    while (!tasks.empty()) {
        std::cout << "Processing: " << tasks.front() << std::endl;
        tasks.pop();
    }
    return 0;
}

This code processes tasks in the order they were added, demonstrating the FIFO nature of queues.

What are the differences between stack and queue?

The main difference is in how they manage data. A stack follows Last In First Out (LIFO) order, meaning the last element added is the first to be removed. A queue follows First In First Out (FIFO) order, where the first element added is the first to be removed.