Delete Node in a Doubly Linked List

Given a doubly linked list and a position p (1-based), delete the node at that position and print the list from head to tail and then from tail to head.

1 <= p <= n <= 1000