4. Let s be a non

-

tail node in a singly linked list L, write a function that deletes s in O(1)

time.

struct node {

int data;

struct node* next;

};

int deleteNode (struct node* s) {