In a linked list of N nodes, how many nodes must be visited in order to locate a node? describing both the ideal and ideal search scenarios Why does a doubly-linked list have Remove but a singly-linked list has RemoveAfter? (). Can a doubly-linked list have RemoveAfter() defined for it? Describe your stance. Could the Remove() function be used on a singly-linked list? Describe your stance.

Assume that the nodes of the singly linked lists are arranged in decreasing order of the exponents of the variable x in order to add the two polynomials.The objective is to create a fresh list of nodes that represents the addition of P1 and P2. This is done by adding the COEFF fields of nodes in lists P1 and P2 that have identical powers of variable x, and then making a new node in the resulting list P1 + P2. The key part of the technique is shown below.The start pointers of the singly linked lists that correspond to the polynomials P1 and P2 are P1 and P2, respectively. Two temporary pointers, PTR1 and PTR2, are created with starting values of P1 and P2, respectively. Make procedural code.

Suppose you have a referenced based implementation of a linked list. What would be the worst case asymtotic runtime of the following functions? Select the tightest. Please explain for each funtion. insert() search() delete() minimum() maximum()

Suppose you have an array-based implementation of a linked list. What would be the worst case asymtotic runtime of the following functions? Select the tightest. Please explain for each funtion. insert() search() delete() minimum() maximum()