If we want a create a doubly-linked list data structure so that we can move from a node to the next node as well as to a previous node we need to add a previous reference to the Node class.Each such DNode (doubly-linked Node) will have a data portion and two DNode references, next and previous.How many references need to be updated when we remove a node from the beginning of a list with many nodes? Consider the first reference and neighboring node(s).
A)1
B)2
C)3
D)4

Question

Quizplus · Accepted Answer

When we remove a node from the beginning of a doubly-linked list with many nodes, we need to update two references: the reference of the header node and the previous reference of the second node in the list (if it exists). No other references need to be updated.

If We Want a Create a Doubly-Linked List Data Structure