A doubly linked list is a data structure consisting of a set of sequentially linked nodes, where each node contains a data field and two references to the next and previous node in the sequence. This bidirectional linkage allows for more efficient operations such as insertion and deletion from both ends of the list compared to a singly linked list.