Question

Suppose we have a doubly-linked list made of Nodes. Each Node contains a char and two Node * variables called Next and Back. We have a Head pointer and a Tail pointer. We would like to have a function which will remove all occurrences of a character called Target from the list. Write the algorithm for the function.

Answer 1

we have a doubly-linked list made of Nodes. Each Node contains a char and two Node * variables called Next and Back. We have a Head pointer and a Tail pointer. We would like to have a function which will remove all occurrences of a character called Target from the list. Write the algorithm for the function.