Answered Questions

  • Nov 13 2010
    02:46 AM
    4075
    10

    Reverse Single Linked List
    • shyamkumar1221

    How will you reverse a single linked list which consists of nodes a to z using recursion?

    sasibhushan.m

    • Jul 31st, 2011

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

    ilushka

    • Jul 29th, 2011

    Lets see...

    Code
    1. node *reverse(node *list) {
      2. 

    2.   node *reversed_last = NULL;
      3. 

    3.  
      4. 

    4.   if (list->next != NULL) {
      5. 

    5.     reversed_last = reverse(list->next);
      6. 

    6.   } else {
      7. 

    7.     return list;
      8. 

    8.   }
      9. 

    9.  
      10. 

    10.   reversed_last->next = list;
      11. 

    11.   list->next = NULL;
      12. 

    12.  
      13. 

    13.   return list;
      14. 

    14. }