Question

Which of the following are true about a doubly linked list?
1. it may be either linear or circular
2. it must contain a header node
3. it will occupy same memory space as that of linear linked list, both having same number of nodes​

Answer 1

Answer:

1

Explanation:

1. it may be either linear or circular

Answer 2

Answer:

The option that is true about a doubly linked list is option 1) - It may be either linear or circular.

Explanation:

Doubly linked list may be either linear or circular.

• Consisting of a set of sequentially linked records called nodes, a doubly linked list is nothing but a linked data structure
• There are two fields contained in that node called as "links" that refers the previous node and the next node in the sequence of nodes.
• When all the nodes are connected to form a circle, the linked list is referred to as Circular Linked List where there is no NULL at the end
• And Linked List, is a type of data structure where each element is a separate object

#SPJ3