Linked list Stack question

I'm working on a Printing Function for my stack, where I create a temporary stack to store the (popped) values of the user implemented stack. They get pushed onto the temp stack, then popped off the temp stack (to retain element order) and printed before the pop back to the original Stack.

The Problem resides in calling a class member function for the temporary stack.
I could just code out my pop & push again for my temp stack, but my instructer would yell at me.

why use a temporary stack. take a leaf out of the STL and use iterators. Add a member to your stack class, just a basic pointer will do nicely if your class is array based. use it to iterate upwards thru the stack printing as you go.

The Assignment has a set header file, and the requirements of the assignment are there to make it a pain, so I'm stuck with the temp Linked list solution, I can hard code the temp stack but if there is a way to use my prebuilt functions on the temp stack my grade won't be affected negatively.

if your stack and tempstack are the same class you can use the same member funcs, you wont need to rewrite them.

Another idea for you is if you cant change your class you can use a std::deque<TYPEOFSTACK> and push_front the popped off the stack value, then copy the deque to cout using the copy algorithm and ostream_iterators
for instance if you have a stack of ints...

Code:

---

std::deque<int> cont;
Stack thestack;
// fill stack here
while(!thestack.empty())
{
  // fill deque with popped values
  cont.push_front(thestack.pop());
}
std::copy(cont.begin(),cont.end(),std::ostream_iterator<int>(std::cout," "));
// now you would have to put the values in the deque back in your stack
while(!cont.empty())
{
  thestack.push(cont.front());
  cont.pop_front();
}

---