#include <iostream>
#include <stack>int main() {std::stack<int> myStack;// Push elements onto the stackmyStack.push(10);myStack.push(20);myStack.push(30);// Access the top elementstd::cout << "Top element: " << myStack.top() << std::endl;// Pop the top elementmyStack.pop();// Check if the stack is emptyif (myStack.empty()) {std::cout << "Stack is empty" << std::endl;} else {std::cout << "Stack size: " << myStack.size() << std::endl;}return 0;
}
queue
#include <iostream>
#include <queue>int main() {std::queue<int> myQueue;// Push elements into the queuemyQueue.push(10);myQueue.push(20);myQueue.push(30);// Access the front elementstd::cout << "Front element: " << myQueue.front() << std::endl;// Access the back elementstd::cout << "Back element: " << myQueue.back() << std::endl;// Pop the front elementmyQueue.pop();// Check if the queue is emptyif (myQueue.empty()) {std::cout << "Queue is empty" << std::endl;} else {std::cout << "Queue size: " << myQueue.size() << std::endl;}return 0;
}