A doubly linked list is a linked list data structure that includes a link back to the previous node in each node in the structure. This is contrasted with a singly linked list where each node only has a link to the next node in the list. Doubly linked lists also include a field and a link to the next node in the list.
A doubly linked list is a kind of linked list with a link to the previous node as well as a data point and the link to the next node in the list as with singly linked list. A sentinel or null node indicates the end of the list. The advantage of a doubly linked list is that entries in the list can be arbitrarily added or removed without traversing the whole list. Doubly linked lists can be implemented in almost any programming language, with differences in how programming languages handle data structures. Doubly linked lists are typically implemented in pseudocode in computer science textbooks.