1.9k views

The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank.

typedef struct node
{
int value;
struct node *next;
} node;
{
Node *p, *q;
q = NULL;
while (p->next != NULL)
{
q=p;
p=p->next;
}
_______________

}    

Choose the correct alternative to replace the blank line.

1. $q=NULL; p \rightarrow next = head; head = p$;
2. $q \rightarrow next = NULL; head = p; p \rightarrow next = head$;
3. $head = p; p \rightarrow next =q; q \rightarrow next = NULL$;
4. $q \rightarrow next = NULL; p \rightarrow next = head; head = p$;
edited | 1.9k views

As per given code $p$ points to last node which should be head in modified.

$q$ is the previous node of tail which should be tail for modified

edited

after the last iteration of the while loop, here's how the condition look like :

on selecting option D; we serve the purpose of moving the last node to the front of the linked list. this is how it works:

its first statement makes $q$ the last node
second statement makes the last node $p$ points to the first node
last statement declares $p$ as the $head$ of the linked list.

0
But when we set q->next=NULL, it will cause the node at p to be set to NULL thus losing the value field.
0
where is the picture ??
0

but, q->next=NULL; will not cause any effect whether it is written at first or at middle or at last, it makes q's linked node as last node.

0
Answer b will be wrong because head =p will make element pointed by p as head then p-> next = head will reset head to it's original position??

Can someone confirm if my understanding is correct?

1
2