C++

We have a deleteNode function which will delete the node with data value val. (Assume the nodes' data values are all different, and there always exists the node to delete). struct Node int data; Node* next; d: int deleteNode (int val) Node *pres-head; Node *prev = NULL ; while(pres->data != val) prev = pres ; pres = pres->next; prev->next pres->next; = return 1; What's wrong with the function? (select all that apply)