Scribd
Upload
67 views2 pages

C++ STL Stack Guide for Beginners

Stacks are a container adapter with LIFO behavior, where new elements are added to one end and removed from only that end. The key functions associated with stacks are empty(), which checks if the stack is empty; size(), which returns the stack size; top(), which returns a reference to the top element; push(), which adds an element to the top; and pop(), which removes the top element.

Uploaded by

Lucas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
67 views2 pages

C++ STL Stack Guide for Beginners

Stacks are a container adapter with LIFO behavior, where new elements are added to one end and removed from only that end. The key functions associated with stacks are empty(), which checks if the stack is empty; size(), which returns the stack size; top(), which returns a reference to the top element; push(), which adds an element to the top; and pop(), which removes the top element.

Uploaded by

Lucas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Stack in C++ STL

Stacks are a type of container adaptors with LIFO(Last In First Out) type of working,
where a new element is added at one end and (top) an element is removed from that
end only.

The functions associated with stack are:


empty() – Returns whether the stack is empty – Time Complexity : O(1)
size() – Returns the size of the stack – Time Complexity : O(1)
top() – Returns a reference to the top most element of the stack – Time Complexity :
O(1)
push(g) – Adds the element ‘g’ at the top of the stack – Time Complexity : O(1)
pop() – Deletes the top most element of the stack – Time Complexity : O(1)
filter_none
edit
play_arrow
brightness_4
// CPP program to demonstrate working of STL stack
#include <iostream>
#include <stack>
using namespace std;

void showstack(stack <int> s)


{
while (![Link]())
{
cout << '\t' << [Link]();
[Link]();
}
cout << '\n';
}

int main ()
{
stack <int> s;
[Link](10);
[Link](30);
[Link](20);
[Link](5);
[Link](1);

cout << "The stack is : ";


showstack(s);

cout << "\[Link]() : " << [Link]();


cout << "\[Link]() : " << [Link]();
cout << "\[Link]() : ";
[Link]();
showstack(s);

return 0;
}
Output:
The stack is : 1 5 20 30 10

[Link]() : 5
[Link]() : 1
[Link]() : 5 20 30 10

Source is GeeksForGeeks, [Link]

You might also like