1. Consider an ADT, a doubly linked list. Each node in a doubly linked list has two pointers, one to its predecessor and another to its successor. Write a function to insert a node to the right of a...

1. Consider an ADT, a doubly linked list. Each node in a doubly linked list has two pointers, one to its predecessor and another to its successor. Write a function to insert a node to the right of a given node p.

2. Consider an ADT, a doubly linked list. Each node in a doubly linked list has two pointers, one to its predecessor and another to its successor. Write a function to insert a node to the left of a given node p.