Insertion of a record in a circularly linked list involves the modification of:

Question

Question

This question was previously asked in

ESE Electronics 2010 Paper 2: Official Paper

Attempt Online

Answer 1

It will require modification of 2 pointers, next of node N1 after which insertion is to be done and next of new node.

We can understand by given example-

Consider A_CLL having 4 Nodes A, B, C, D

F1 Neha B 18.2.21 Pallavi D 5

A New Node E is inserted between B & C:

F1 Neha B 18.2.21 Pallavi D 6

So 2 pointer modification required.