How many nodes will be visited during a search for a node that is in a linked list with N nodes? Describe the best- and worst-case scenarios for a search. Explain why a singly-linked list has the...

How many nodes will be visited during a search for a node that is in a linked list with N nodes?

Describe the best- and worst-case scenarios for a search.

Explain why a singly-linked list has the RemoveAfter() function while a doubly-linked list has the Remove() function.

Is it possible to create a RemoveAfter() method for a doubly-linked list as well? Explain why you think that is or why you don't think that is.

Is it possible to create a Remove() method for a singly-linked list as well? Explain why you think that is or why you don't think that is.