Question

Write a program: Write all the code for a data-structure that can act like a queue or a stack. Items can be pushed/popped from the front and pushed/popped from the back. Put 10 numbers into the structure. Then take it out so you can print it backwards. Then, do the same thing, but print it forward. What is the name of this structure? (Use a stl linked list for the internals)

C++ Language

Answer 1

#include <iostream>
#include <list>
using namespace std;

int main( )
{
list<int> intlist;
list<int>::iterator ptr;
int i;

//checking whether the list is empty
if (intlist.empty( ) ==true)
{
cout<<endl<<"Adding item in the list";
}

//adding 10 values to the list (0 1 2 3 4 5 6 7 8 9 10)
for( i = 0; i<10; i++)
{
intlist.push_back( i*i );
}

//initializing the iterator to the first node

ptr=intlist.begin( );
//cout<<endl<<"First element has value: "<<*ptr;

//traversing through the list by incrementing the iterator
cout<<endl<<"Print list content in forward direction : ";
for (i = 0; ptr != intlist.end( ); i++)
{
cout<<" "<<*ptr; //displaying the value at that node
ptr++;
}

cout<<endl<<"Print List content in backward: ";
ptr = intlist.end();
for (i = 9; ptr != intlist.begin(); i--)
{
ptr--;
cout<<" "<<*ptr;
}

return 0;
}