Reversing a single linked list using stack

In Algorithms, C Tidbits, Data Structures in C/C++ on March 30, 2007 at 3:40 pm

Here is the routine for reversing single linked list using a stack, for reversing linked list using pointers, see the earlier post. For reversing linked list recursively visit this post. This routine takes a single linked list as argument and reverse it and returns back the head node to the reversed list.

please refer http://www.refcode.net/2013/02/reversing-single-linked-list-using-stack.html
  1. hello , i been trying to check some of the articles here and alot dont work .. like the reverse using stack and this one! .. please note.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: