Reverse List

Node *new_head = NULL;

void reverse_list( Node *head )
{
    Node *np = head->next;

    if( np )
    {
        if( np->next )
        {
            reverse_list( np );
            head->next = NULL;
        }
        else
            new_head = np;

        np->next = head;
    }
}