Question: Assume node is: struct node { int data; node head ) { if ( head = = NULL ) return; fun 1 ( head -

Assume node is: struct node{int data; node head)
{
if(head == NULL)
return;
fun1(head->next);
cout head->data;
}
Prints alternate nodes in reverse order
Prints alternate nodes of Linked List
Prints all nodes of linked lists
Prints all nodes of linked list in reverse order
 Assume node is: struct node{int data; node head) { if(head ==

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!