Tutorials and Code

ActionScript (5)
ASP (7)
ASP.NET (28)
Assembly (1)
C (6)
C# (132)
C++ (33)
CSS (6)
General (4)
HTML (6)
Java (28)
JavaScript (38)
MySQL (2)
Objective C (1)
Pascal (1)
PHP (61)
Python (3)
Ruby (18)
Silverlight (1)
SQL (7)
VB.NET (5)
Visual Basic (3)

Syndication

My Account

Community Forums

Webmaster Tools

Tech Jobs

Geekpedia » C++ Code » Reverse a linked list

Reverse a linked list

This code shows the logic behind reversing a linked list in C++ using pointers and looping through the current nodes, changing the order in which the elements are linked to eachother.

On Tuesday, November 6th 2007 at 11:20 PM

By Andrew Pociu (View Profile)

(Rated 2.8 with 4 votes)

Contextual Ads

More C++ Resources

NodePtr revList = NULL
NodePtr currNode = currHead;
 
while(currNode != NULL)
{
        // Set the head to the next node
        currHead=currHead->next;
        
        // Link currNode to the reversed list
        currNode->next=revList;
        revList=currNode;
        
        // Move currNode to next node
        currNode=currHead;
        currHead=revList;
}

Digg It!

Del.icio.us Reddit

StumbleIt

Newsvine

Furl

BlinkList

Rate this code snippet

Current Comments

by deivapalan on Monday, November 12th 2007 at 08:32 PM

//set head to next node

currHead = currNode->next

is correct way.

by Nimesh on Thursday, April 10th 2008 at 08:15 PM

void linklist::reverse()
{
node *curr = p, *prev = NULL, *nxt_fwd = NULL;
//p is header
while(curr)
{
nxt_fwd = curr->link;
curr->link = prev;
prev =curr;
curr=nxt_fwd;
}
p = prev; /*save the new head */

}

by Cfir on Tuesday, July 21st 2009 at 04:52 PM

currHead=revList;
it's need to be outside the while

by newbie on Tuesday, August 18th 2009 at 12:59 PM

I think this is a working recursive solution:

Node * reverse(Node* previous=NULL, Node* head, Node* next)
{
head->child = previous
if(next==NULL)
return head;
else
return reverse(head,next,next->child);
}