A commonly used data structure is a doubly-linked list, where each node has a pointer to the next node, as well as to the node that precedes it in the list. Here is how the nodes would be declared:

Given a pointer Node * foo that points to a node in such a doubly-linked list, write code to delete that node from the list (maintaining that the remaining nodes are still in a doubly-linked list). Be sure to handle the cases where the node foo points to has no previous node, or no next node. Also, remember not to leak memory!

struct Node t int data; // In real life, this would be whatever data you want to store Node prev; I/ Pointer to the previous node in the list. Node * next; // Pointer to the next node in the list