ABSTRACT
The previous chapter explained linked lists. Each Node has precisely one link called next. Traversing the list to find a given node means starting at the first node-usually called the head-and visiting each node in turn. In a doubly linked list, each Node has two links (next and previous). A doubly linked list allows for traversing forward using next and backward using previous. Even though doubly linked lists are more convenient, they still have the same limitations of singly linked lists. If the list is long, then finding particular nodes may require visiting many nodes. If we want to efficiently add and remove data, a linked list is insufficient.
