Suppose we define a linked list of ints using the following struct.

/*

*struct for a single node in a linked list. info contains the data

*stored in this node. next contains a pointer to the node with * the next piece of data.

*/ struct node

{ int info; struct node *next;

} ;

typedef struct node node;

Write the recursive function deleteNode which deletes the first node in the linked list whose member variable info equals x.

Outline of the function:

If Head is NULL return NULL.

Else, if the member variable info of the node pointed to by Head equals x, deleteNode deletes the node pointed to by Head. And returns a pointer to the next node in the linked list.

Else, it should recursively call deleteNode on the next node in the linked list. It sets Heads next to the pointer returned by this recursive call. It then returns Head.

1)

node* deleteNode(node *head, int x){

Now suppose we define a doubly linked list of ints using the following struct.

/*

*struct for a single node in a linked list. info contains the data

*stored in this node. next contains a pointer to the node with * the next piece of data. prev contains a pointer to the node with * the previous piece of data.

*/ struct node

{ int info; struct node *next; struct node *prev;

} ;

typedef struct node node;

How does this change the function deleteNode? Rewrite it below with the required modifications:

2)

node* deleteNode(node *head, int x){