manubn

 Profile Answers by manubn 

• Nov 15th, 2010

 

Function : 

// Returns - the pointer to the starting node of the reversed linked list.

// Parameters - Previous node, Current node

Node* listReverse( Node* prev, Node* ptr )

{

   Node* res = NULL;

   if( NULL == ptr )

   {

    res = prev;

   }

   else

   {

    res = listReverse( ptr, ptr->next );

    ptr->next = prev;

   }

   return res;

}

I hope this function suffices the question.

Usage: 

Node* prev = NULL;

Node* reversedList = listReverse( prev, ptr );// ptr is the start of the linked list.

hari_nowayout

 Profile Answers by hari_nowayout Questions by hari_nowayout

• Mar 26th, 2011

 

The above two answers have bugs... They don't work correctly... Here is the code

struct node* reverse(node *head)

{

   node *current=NULL;

  if(head->next==NULL)

  {

      //we have only one element in our list

      current=head;

  }

  else

 {

    current=reverse(head->next);

    head->next->next=head;

    head->next=NULL;

 }

 return current;

}

shri

• Jul 15th, 2011

 

//hope this may work

Code
span style="font-style: italic;">//we have only one element in our list

Shrima Baskar

 Profile Answers by Shrima Baskar 

• Jul 26th, 2011

 

It works in gcc compiler

Code
span style="font-style: italic;">//call tot he function

ilushka

 Profile Answers by ilushka 

• Jul 29th, 2011

 

Lets see...

Code
 

sasibhushan.m

• Jul 30th, 2011

 

node* reverse_recursive(node *root)
{
if(root->link != NULL)
{
reverse_recursive(root->link);
root->link->link = root;
return (root);
}
else
{
head = root;
}
}