ravyg

Node* deleteNode(Node* head, int val) {
    if (head != NULL) {
        Node* curr = head;
        Node* prev = nullptr;
        while(curr->val != val) {
            prev = curr;
            if (curr->next != nullptr) curr=curr->next;
            else return nullptr;
        }
        if (prev != nullptr) prev->next = curr->next;