Implement a doubly linked list.

A doubly linked list is a data structure where each node contains a value, a pointer to the next node, and a pointer to the previous node. This allows for traversal in both forward and backward directions. The list is managed through a head pointer, which points to the first node, and potentially a tail pointer for the last node. Operations like insertion and deletion involve updating these pointers to maintain the list's integrity.