Tutorials
- ASP.NET
- C#
- C++
- Java
- JavaScript
- MySQL
- PHP
- Ruby
- SQL
- VB.NET
Code
How To
News
Forums
Pictures
Videos
Icons
Newsgroups

Building a C# Chat Client and Server

A step by step tutorial teaching you how to create your own chat client and chat server easily in C#, for local networks or the Internet.

in C# Programming Tutorials

Getting Hard Drive Information

A C# tutorial showing you how to make use of WMI to extract information on disk drives, such as model, capacity, sectors and serial number.

in C# Programming Tutorials

UPS Shipping Calculator

This tutorial will teach you how to calculate the shipping cost based on the weight, height, length and depth of the box, the distance and the UPS service type.

in PHP Programming Tutorials

Create Your Own Rich Text Editor

Creating a Rich Text Editor using JavaScript is easier to do than you might think, thanks to the support of modern browsers; this tutorial will walk you through it.

in JavaScript Programming Tutorials

Tutorials

Programming Tutorials

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 (8)
VB.NET (5)
Visual Basic (3)

IT Jobs

From CareerBuilder

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.7 with 6 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);
}