t - >next=rear: Now the pointer t holds the ex-last node of the linked list. The address of the new
inserted end node is assigned to the link field of node through pointer t.
rear->next=NULL: The rear pointer holds the address of the last node and its link field is assigned
a NULL value.
Insertion of a Node at a Given Position
Insertion of a node can be done at a specific position in the linked list. The following figure and
program explain the insertion of a node at the specific position in the linked list. Suppose we want
to insert a node at the third position, then observe Fig. 14.21.
(a) Form ...
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.