Structure of a doubly linked list

Like a singly linked list, a doubly linked list is a chain of nodes. Below is how these nodes chain together to form a doubly linked list.

When represented logically in a diagram, these nodes might look sequential (left to right, one after the other), but in reality, they are scattered all around in memory at random locations, and the only way to access a node is by using its address in memory.