queue et stack: Ordre Fifo et Lifo

Author:


Download

#include 
#include 
#include 
#include 

using namespace std;

int main()
{

	char *str[]={"A", "B", "C", "D"};
   queue q;

   cout << "Ordre FIFO avec 'queue':";
   for(int i=0; i<4;i++)
	   q.push(*(str+i));

   stack s;
   while (q.size() > 0)
   {
      string lettre = q.front();
      q.pop();
      cout << lettre << " ";
      s.push(lettre);
   }
  cout< 0)
   {
      cout << s.top() << " ";
      s.pop();
   }
	cout<
    

Leave a Reply

Your email address will not be published. Required fields are marked *