Given the doubly linked list in the diagram below, give the code to delete the second node in the list with the number 31. Assume each entry in the list is a node of class Node with a public next and prev member variable.

Question

Answer 1

```
Node *toDelete = head->next;
head->next->next->prev = head;
head->next = toDelete->next;
delete toDelete;
```