Open In App
Related Articles

Data Structures | Linked List | Question 5

Improve Article
Save Article
Like Article

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


/* 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;

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


*head_ref = prev;


*head_ref = current;


*head_ref = next;


*head_ref = NULL;

Answer: (A)


The statement to update the head pointer could be as follows

*head_ref = prev;

This statement sets the value of *head_ref (which is a double pointer) to the value of prev, which is the new head of the reversed list.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads
Related Tutorials