Question

In double linked list, node contains address of ___ other nodes

2

4

3

1

Answer 1

Answer:

Only (i)

Explanation:

Doubly linked list may be either linear or circular statements are true:-

Doubly linked list:-

A doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links that are references to the previous and to the next node in the sequence of nodes.

Circular linked list:-

Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. A circular linked list can be a singly circular linked list or doubly circular linked list.

Linear linked list:-

A linked list is a linear data structure where each element is a separate object. Each element of a list is comprising of two items, the data and a reference to the next node. The last node has a reference to null. The entry point into a linked list is called the head of the list.