Question

write the procedure in which you can insert an element at the end of a linked list. use your own variable names and instructions​

Answer 1

Explanation:

Create a new node and make sure that the address part of the new node points to NULL i.e. newNode->next=NULL.

Traverse to the last node of the linked list and connect the last node of the list with the new node, i.e. last node will now point to new node.