Answer:

The answer to some of the design questions depends on what the list is expected to be used for. But reasonable answers are:

What should be done if value is not in the list? Return true or false for item deleted or not.
What should be done if several nodes hold value? Delete only the first instance.
Are two pointers (current and next) needed? Yes. The logic is similar to case IV.

delete

The pictures show two situations.

Two pointers traverse the list, one behind the other, until the leading pointer (next) encounters the node to be deleted. Then that node is unlinked from the node current points to.

QUESTION 15:

With insertInOrder() had four cases. What cases are there with delete() (not all are shown in the picture)?