The Following Function Reverse Is Supposed To Reverse A Singly #64

The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.</p> <pre><code class="language-java"> /* 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*/ } </code></pre> <p>What should be added in place of “/*ADD A STATEMENT HERE*/”, so that the function correctly reverses a linked list.

This multiple choice question (MCQ) is related to the book/course gs gs121 Data Structures and Algorithms. It can also be found in gs gs121 Abstract Data Types - Singly Linked Lists Operations – 3 - Quiz No.1.

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