Assume a singly linked-list (List) class of nodes sorted by item value (smallest in front) without
duplicates. The node and class is defined below.
Write the member function Remove which takes an Item object (it) by constant Reference as an
argument. The function removes the item (it) from the list and deletes it. The function returns an
integer which is the number of items which are greater than the item (it) that are still in the list.
Make sure that no memory is leaked in your implementation..
ENGLISH5 QUARTER4 MODULE1 WEEK1-3 How Visual and Multimedia Elements.pptx
Assume a singly linkedlist List class of nodes sorted by .pdf
1. Assume a singly linked-list (List) class of nodes sorted by item value (smallest in front) without
duplicates. The node and class is defined below.
Write the member function Remove which takes an Item object (it) by constant Reference as an
argument. The function removes the item (it) from the list and deletes it. The function returns an
integer which is the number of items which are greater than the item (it) that are still in the list.
Make sure that no memory is leaked in your implementation.
