The insertion of node can be done in between two nodes and hence the preceding and succeeding
nodes must be stored in separate pointer variables. When the user specifies 2, the entered value is
reduced by 1 and becomes 1 and is stored in variable k. When value of k is 1, the address of the first
node is stored m the pointer pr. When k is 1, the statement (b) has no reason to consider. The address
of the succeeding node is obtained by the statement (c) and the address obtained is stored in the
pointer variable su. Th
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.