A Doubly Linked List is a data structure that consists of a sequence of nodes, where each node contains three components: a data value, a pointer to the next node, and a pointer to the previous node. This allows traversal of the list in both directions—forward and backward—making it more flexible than a singly linked list. In a Doubly Linked List, the first node is called the head, and the last node is called the tail. Each node's previous pointer points to the node before it, while the next pointer points to the node after it. This structure is useful for applications that require frequent insertions and deletions.