Question: What does the following operation do for a given linked list with an initial node as head? A. Prints all nodes of linked lists B.
What does the following operation do for a given linked list with an initial node as head?

A. Prints all nodes of linked lists B. Prints all nodes of linked list in reverse order C. Prints alternate nodes of Linked List D. Prints alternate nodes in reverse order
void funl (struct node* head) { } if (head NULL) return; = fun1 (head->next); printf("%d", head->data);
Step by Step Solution
3.39 Rating (161 Votes )
There are 3 Steps involved in it
B Explanation 1 In the above example recursive function call is used 2 printf statement i... View full answer
Get step-by-step solutions from verified subject matter experts
