The following function reverse() is supposed to reverse a singly linke – McqOptions

MCQOPTIONS

1.	The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.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» B. *head_ref = current,

Discussion

No Comment Found

Related MCQs

What kind of linked list is best to answer question like What is the item at position n?
What s wrong with this code which returns xor of two nodes address ?
Which of the following statements are true ?i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices.ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don t contain literal pointersiii)in order to calculate the address of the next node you need to remember the address of the previous nodeiv)xor lists are much efficient than single, doubly linked lists and arrays
While creating a linked list or inserting an element into a linked list, whenever a request for the new node arrives, the memory manager searches through the for the block of desired size.
is very useful in situation when data have to stored and then retrieved in reverse order.
Direct or random access of elements is not possible in
If start is pointing to first node of the linked list then consider the following statement -start = start->next;current = start->next;what will be the value of address field of current ?
Each node in a linked list has two pairs of .. and .
There is an extra element at the head of the list called a .
struct node *current = start->nextwhat current will contain if it is variable of type struct node ?