Write a recursive function that removes all nodes containing x from a list. Since the first node pointer may be deleted, it is passed in by reference.

void replaceValues(Nodetype* &p, int x)

Example format for code:

template void insertBefore(nodeType* &p, T x, T y)

{

if(p == NULL)

return;

insertBefore(p->next,x,y);

if(p->info == y)

p = new nodeType(x,p);

}