Select the correct option to test your answer:
Computer
Introduction To Data Structures
Difficulty: Medium
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; } /*ADD A STATEMENT HERE*/ } What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.
More Computer Questions
What is the time complexity for inserting/deleting at the beginning of the array?
The . . . . . . . . function takes an arbitrary number of arguments and concatenates them one by one into character strings.
Which of the following statement would read file "foo.txt"?
Which keyword is used to make a member function constant in C++?
Which class is typically used to implement a `List` in the Java Collections Framework?