COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
a pointer is maintained to store both next and previous nodes.
|
|
|
two pointers are maintained to store next and previous nodes.
|
|
|
a pointer to self is maintained for each node.
|
|
|
none of the above.
|
Detailed explanation-1: -Doubly Linked Lists and Circular Lists Doubly linked lists are like singly linked lists, except each node has two pointers–one to the next node, and one to the previous node.
Detailed explanation-2: -In a doubly linked circular linked list, each node has pointers that point to both the next node and the previous node.
Detailed explanation-3: -Doubly Linked List. There are two pointer storage blocks in the doubly linked list. The first pointer block in each node stores the address of the previous node. Hence, in the doubly linked inventory, there are three fields that are the previous pointers, that contain a reference to the previous node.
Detailed explanation-4: -Which of the following information is stored in a doubly-linked list’s nodes? Answer: D) Explanation: A doubly linked list stores information about the value, and addresses of previous and next nodes.