CREATING STACK USING STL

 STACK IN STL

Standard library provides us stack container with number of built in features.

STACK TEMPLATE :

template <class T, class Container = deque<T> > class stack;

MEMBER FUNCTIONS :

All these operations can be performed in 0(1)

empty  :  test whether the container is empty

size    : return the size of the container

top   : return the top element

push  : insert element

emplace  : construct and insert element

pop  : remove top element

swap  : swap contents

CODE ;

#include <iostream>
#include <stack>    // for using stack container
using namespace std;

int main()
{
int sum = 0;
stack<int> mystack; // declaring stack
mystack.push(21);   // inserting element
mystack.push(32);
mystack.push(23);
mystack.push(63);
mystack.push(212);

while (!mystack.empty()) {   // checking the empty condition
sum = sum + mystack.top();   // checking the top element
mystack.pop();               // performing pop operation
} 
cout << sum;
return 0;
}