Deleting anitem from a linked list is best when performed using two pointersso that the deleted item is freed from memory.
a. true
b. false

a.True.

Explanation:

To delete a node from linked list it is best to do it by using two pointers suppose say prev and curr. Iterating over the linked list while curr is not NULL and updating prev also.On finding the node to be deleted we will set the prev so that it points to the next of curr and after removing the link we will free curr from memory.

line of code for deleting a node in c++:-

prev->next=curr->next;

delete curr;  or  free(curr);

difference where there's no picture?