Doubly Linked Lists A doubly linked list is a chain of nodes, each of which has three components: data, next, and previous. The data component holds a reference to some data, the next component holds...

Doubly Linked Lists

A doubly linked list is a chain of nodes, each of which has three components: data, next, and previous. The data component holds a reference to some data, the next component holds the address of the next node in the list, and the previous component holds the address of the previous node in the list. See Figure 16.26 .