A doubly-linked-list is a computer science data structure consisting of nodes. Each node has 2 links, one to the node before, and one to the node after. By following these links, the data structure can be traversed both forwards and backwards, but not in a random fashion. These links also make it easy to add nodes to any arbitrary point of the structure.