Counting number of pointer modification

Question

In circular linked list, insertion of a node at the end involves pointer modification:

(A) one
(B) two
(C) three
(D) none

Answer 1

we have to update pointer of two node 
1. update the pointer of last node  to address of newly created node 
2. update the pointer of newly created node i.e. NULL to address of first node 
      
 

Comments

That is pointer of last node . What I am asking is about pointer which point to last node . Which indicates it is last node

---

we have to update only last node of given list and newly created node.

---

check this link https://gateoverflow.in/67068/linked_list#c67135