A stack for characters : stack « queue stack « C++ Tutorial






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

using namespace std;
int main()
{
  stack<char> stck;

  cout << "A stack for characters.\n";

  cout << "Pushing A, B, C, and D.\n";
  stck.push('A');
  stck.push('B');
  stck.push('C');
  stck.push('D');

  cout << "Now, retrieve those values in LIFO order.\n";
  while(!stck.empty()) {
    cout << "Popping: ";
    cout << stck.top() << "\n";
    stck.pop();
  }

  return 0;
}








21.1.stack
21.1.1.Instantiation of an STL Stack
21.1.2.Push and pop an int stack
21.1.3.Push and pop a vector stack
21.1.4.Push and pop a stack of list
21.1.5.Working with a stack of Integers
21.1.6.Stack: size, pop and push
21.1.7.Stack: size and push
21.1.8.Stack: top, empty
21.1.9.Modify the top element in a stack
21.1.10.stack of string and vector of string
21.1.11.A stack for characters
21.1.12.stack of pairs
21.1.13.Pass stack to a function