IDG. Figure 1. Traversing a doubly-linked list forward and backward. CRUD operations in doubly-linked lists. Creating, inserting, and deleting nodes are all common operations in a doubly-linked list.

Given a new node and the element of an existing node, we would like to insert the new node after the first node in the direction of traversal that has the given element (Listing 1). Inserting a node ...