How to get the address of 1st node in <list>

[razzle]

Reversing Linklist using Stack.

The STL containers don't give you access to implementation detail like say internal pointers.

What you could do is push the elements on stack, clear the list, and then rebuild it with the elements in reverse order.

A more efficient way would be to use one forward iterator and one reverse iterator to swap the list elements pairwise until the iterators meet in the middle.

Also note that std::list has a reverse function already.