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

[tushu]

Reversing Linklist using Stack.
I have created linklist using <list> STL. Now I want to push address of each node in Stack. For that I want address of 1st node so that I will assign it to "temp" and I can use following loop.

 while (temp != NULL)
        {
            s.push(temp);
            temp = temp->next;
        }
 

But I am not getting address of 1st node. I tried function l1.front() which gives 1st element but not address.
Can anyone help me ?

[weaknessforcats]

If you are using front() and push() I suspect you are using an STL container.

Why would you want the address of the first node?? front() returned the element.

All those addresses are managed by the container in order to preserve the structure of the container. Letting an address escape allows some hacker guy to mess with the internals of the container and compromise the whole structure.

[tushu]

I want address of 1st element because " I want to push that address on to the Stack"
Because I am reversing the linklist using stack. Ones I got the 1st address , with that I will push all the remaining address's into stack with the help of above code.
And then I am going to retrieve top most address ( which will be last element's address. )

[weaknessforcats]

This is the code to reverse a <list>

list<int> thelist;
    list<int>::reverse_iterator itr;
 
    for (itr = thelist.rbegin(); itr != thelist.rend(); ++itr)
    {
 
    }

You just iterate the list using a reverse iterator. When you increment a reverse iterator it backs up.

Of course you have to start at the end of the list, which is obtained by using rbegin() (right-begin) and you end at the beginning of the list, which is obtained by rend() (right-end).

The problem with pointers here is that the list container moves stuff around. So later when you get around to using your pointer, it's invalid and your program crashes.