Chapter 17.2, Problem 17.8CP

Explanation of Solution

Linked list:

Linked list is a linear and dynamic data structure which is used to organize data; it contains sequence of elements which are connected together in memory to form a chain. The every element of linked list is called as a node.

Deleting a node from a linked list:

Deleting a node from a linked list is the process of removing a node from the linked list.

Steps to delete a node:

There are two steps to delete a node from a linked list, which are as follows:

• Remove the node from the list without breaking the links created by the next pointers.
  • To delete particular value from the linked list without breaking the links, connect the address link of previous node to the node that is available at next to the node that required to be deleted. This process will remove the node from the list without breaking the links.
• Delete the node from memory.
  • This step is used to free the memory space of the node by using “delete” operator...