Careercup 2.3 - Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node EXAMPLE Input: the node ‘c’ from the linked list a->b->c->d->e Result: nothing is returned, but the new linked list looks like a->b->d->e

gistfile1.txt

void delGivenNode(node *entry){
  entry->data = (entry->next)->data;
	entry->next = (entry->next)->next;
	delete entry->next;
}