In class, we went over node insertion in detail Consider a linked list w here ea

Question

In class, we went over node insertion in detail Consider a linked list w here each node in of the type struct Node, as defined on display 13.7 on pope 754. Complete the definition of the function deleteNode (declaration is shown below). that lakes 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 he empty. If you cannot w rite out the program function in the space provided below, then print it out on a separate sheet of paper and attach dial to this homework. void deleteNode(struct Node*8 head, int value);

Explanation / Answer

Since the code for the node insertion is not given,providing the general implemetation of the deletenode based on the linked list.

void deleteNode(struct node **head, int value)
{
if (!head || !(*head)) {
cout<<”Node Empty”;
}

struct node* valtemp = *head;
struct node* prev = NULL;

while (valtemp->POS != value && valtemp->next != NULL)
{
prev = valtemp;
valtemp = valtemp->next;
}

if (valtemp->POS == value)
{
if (prev)
{
prev->next = valtemp->next;
}
else
{
*head = valtemp->next;
}
free(valtemp);
cout<<”node has been deleted”;
}
}

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.