/* stack is FILO (First in last out) data structure. The element added first is the element to be removed at last and the one added at last is to be removed first. No random access to elements of stack. Elements can be inserted and removed only from one end called top. more on it : https://en.cppreference.com/w/cpp/container/stack | | | e5 |<- top element inserted at | | last | e4 | | | | e3 | | | | e2 | | | | e1 |<- element inserted first will |______| be removed at last #mn */ #include #include using namespace std; int main() { stack s1({ 1,2,3,4,5,6,7,8,9,10 }); while (!s1.empty()) cout << s1.top()<<" ", s1.pop(); cout << "\nAll elements popped from stack s1\n"; /* s1 - stack name stack s1({ 1,2,3,4,5,6,7,8,9,10 }); - envokes std::initializer_list of stack class.(since c++11). here is template argument. top- method returns top element from stack without removinhg it from stack. empty-method returns a boolean value. true if stack is empty false if it has some elements pop-removes topmost element from stack. returns void . something like cout< s2; s2.push('a'); s2.push('b'); s2.push('c'); /* push - method pushes a new element on top of stack. */ cout << "there are " << s2.size() << " elements onto the stack \n"; /* size -method returns number of elements in stack. */ while (!s2.empty()) { cout << s2.top()<<" popped \n"; s2.pop(); } cout << "\n[End]"; /* that's all for now some things like emplace method are missing , I will add the after completely understanding. Thanks if read so far ... */ return 0; //😌 }

stack | mn