To insert a node at the end of the singly connected linked list having ‘p’ nodes,

1.4 To insert a node at the end of the singly connected linked list having ‘p’ nodes, how
many nodes are to be traversed for this insertion operation?
A) p/2
B) p
C) 1
D) none of the above

Leave a Reply