node:

struct node { char name 20]; int number; To_Do_Item* next; };

c++ code in which the function will remove the specified item and will leave the list sorted.

input parameters: node * &head, node * &node;

for example

orginal linked list: 1 James -> 2 Bob -> 3 Cat;

and we want to remove the head->next node = 2 Bob

than after the removing the node the linked list is: 1 James -> 3 Cat.