UGC NET CSE | December 2007 | Part 2 | Question: 12

Question

Consider the following linked list :

Which of the following piece of code will insert the node pointed to by $q$ at the end of the list ?

• A. $\text{for (p=list; p !=NULL; p=p → next);}\\ p=q;$

• B. $\text{for (p=list; p !=NULL; p=p → next);}\\ \text{p→next=q;}$

• C. $\text{for (p=list; p→next !=NULL; p=p → next);}\\ p=q;$

• D. $\text{for (p=list; p→next !=NULL; p=p → next);}\\ p→next=q;$

Comments

Answer should be D.

---

Option D

Answer 1

To insert a node at last following procedure must be followed:

1. The list is traversed up to the last node.

2. Link field of the last node is updated (now pointing to the new node)

So option (D)  is correct.

Here link field is updated only one time.

Answer 2

// Reach the last node and stop.

for (p=list; p→next !=NULL; p=p → next);

// Change the next pointer of the last node to point to the NEW NODE.

p→next=q;