Write a recursive function that prints out the items of a (possibly empty) singly linked list of integers in reverse order. The function should run in linear time.

Follows are the method definition to this question:

void Reverse_Order(struct Node* h)//defining a recursive method Reverse_Order that takes structure in parameter

{

if (h == NULL)//use if block to check head equal to null

return;//use return keyword

Reverse_Order(h->next);//call method recursively

cout<<h->data;//print data

}

Explanation:

In the above code, a recursive method "Reverse_Order" takes structure as the parameter, and inside the method, structure variable h is used that uses the if conditional statement to check the header equal to null.

In the condition is true, it will use the return keyword, and in the next step, it calls the method recursively, and print its value in the reverse order.

i think the answer is b.