• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Data Structures | Linked List | Question 5

The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function. 

C
/* Link list node */
struct node
{
    int data;
    struct node* next;
};

/* head_ref is a double pointer which points to head (or start) pointer 
  of linked list */
static void reverse(struct node** head_ref)
{
    struct node* prev   = NULL;
    struct node* current = *head_ref;
    struct node* next;
    while (current != NULL)
    {
        next  = current->next;  
        current->next = prev;   
        prev = current;
        current = next;
    }
    /*ADD A STATEMENT HERE*/
}
 

What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.

(A)

*head_ref = prev;

(B)

*head_ref = current;

(C)

*head_ref = next;

(D)

*head_ref = NULL;

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments