C++

In class, we went over node insertion in detail. Consider a linked list where each node is of the type struct Node, as defined on display 13.7 on page 754. Complete the definition of the function deleteNode (declaration is shown below), that takes as input a pointer to the head of the list, and an integer value. The function should delete all the nodes in the list whose data members have the given value. If there is no node with the given value, the function should not do anything. You can assume that the list will not be empty. If you cannot write out the program function in the space provided below, then print it out on a separate sheet of paper and attach that to this homework.

void deleteNode(struct Node*& head, int value);