A Doubly Linked List is a linear data structure. It is a collection of objects defined as nodes. But unlike the linked list, the node has two pointers, one previous pointer and the other next pointer. Just like linked list nodes are stored in random positions in memory and not stored in contiguous locations. Double Linked List vs Linked List Double-linked lists allow us to traverse the linked list in both forward and backward directions, but it comes at the cost of extra space required by the prev pointer for every node.