Revesing the elements in a linklist.

[Parul Bagadia]

I m getting stuck about back tracking the list;
i can traverse the list in forward direction, and reach till the end of list; but how will i make it go back ; is the problem.

[Encrypted]

I m getting stuck about back tracking the list;
i can traverse the list in forward direction, and reach till the end of list; but how will i make it go back ; is the problem.

u may keep track of the previous address in the linked list..
a way to do it is to use a doubly linked list... :)
nevertheless i think u need to explain your problem in detail..i mean why would u like to back track the list... :|

[mac11]

I m getting stuck about back tracking the list;
i can traverse the list in forward direction, and reach till the end of list; but how will i make it go back ; is the problem.

How is the list implemented?

If you're using the list from the stl you can use reverse iterators, but some lists are made using a single link between nodes and you can't go backwards through them.

[Parul Bagadia]

How is the list implemented?

If you're using the list from the stl you can use reverse iterators, but some lists are made using a single link between nodes and you can't go backwards through them.

Yaeh its a singly link list. And we are supposed to use the same thing.

[RedSon]

Yaeh its a singly link list. And we are supposed to use the same thing.

You need to have a temporary node pointer, pointing to the previous node. There is no other way. If you list is singly linked there is no way to traverse backwards.

[Ganon11]

Not necessarily. You could look at the first node, and make that the head of your new list.

Now you look at the second node. Copy the data into a new, blank node. Set this new node's next pointer to the head node. Now make this node the head.

Repeat as desired.

EDIT: This is if you wish to obtain a list that is the reverse of the original list.

If you want to traverse the list backwards while maintaining the original order in a singly-linked list, there is no way.