What does the following function do for a given Linked List with first node as head?void fun1(struct node* head){ if(head == NULL) return; fun1(head$rightarrow$next); printf(%d , head$rightarrow$data);}

DATA STRUCTURES

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

What does the following function do for a given Linked List with first node as head?void fun1(struct node* head){ if(head == NULL) return; fun1(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

Explanation:

Detailed explanation-1: -What does the following function do for a given Linked List with first node as head? Explanation: fun1() prints the given Linked List in reverse manner.

Detailed explanation-2: -Prints all nodes of linked lists.

Detailed explanation-3: -The first node in the list is called the head, and the last node in the list is called the tail. To create a singly linked list, we first need to create a node class.

Detailed explanation-4: -Array implementation of linked list.

There is 1 question to complete.

MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES