deletion is also more than one step process we shall learn with pictorial representation firstlocate the target node to be removedby using searching algorithms the left (previousnode of the target node now should point to the next node of the target node leftnode next -targetnode nextthis will remove the link that was pointing to the target node nowusing the following codewe will remove what the target node is pointing at targetnode next -nullwe need to use the deleted node we can keep that in memory otherwise we can simply deallocate memory and wipe off the target node completely reverse operation this operation is thorough one we need to make the last node to be pointed by the head node and reverse the whole linked list