Write a function named removeAll that accepts two parameters:
a reference to a pointer to a ListNode representing the front of a linked list,
and an integer value.
Your function should remove all occurrences of that value from the list.
You must preserve the original order of the remaining elements of the list.
For example, if a variable named front points to the front of a list containing the following values:
{3, 9, 4, 2, 3, 8, 17, 4, 3, 18}
Then the call of removeAll(front, 3); would remove all occurrences of the value 3 from the list, yielding the following values:
{9, 4, 2, 8, 17, 4, 18}
Constraints:
Do not modify the data field of existing nodes; change the list by changing pointers only.
Do not construct any new ListNode objects in solving this problem (though you may create as many ListNode* pointer variables as you like).
Do not use any auxiliary data structures to solve this problem (no array, vector, stack, queue, string, etc).
Assume that you are using the ListNode structure as defined below:
struct ListNode {
int data; // value stored in each node
ListNode* next; // pointer to next node in list (nullptr if none)
}
