Question

Which type of link list does not store NULL in the next field

Answer 1

Answer:

In a single linked list, every node has link to its next node in the sequence. So, we can traverse from one node to other node only in one direction and we can not traverse back. We can solve this kind of problem by using double linked list.

Answer 2

Answer:

Circular linked list is a link list where all nodes are connected to form a circle. there is no NULL at the end.

Explanation:

• Circular linked list is a link list where all nodes are connected to form a circle. there is no NULL at the end.
• Circular linked list, a circular linked list is either a singly or doubly linked in which there are no null values.
• The main difference between the doubly linked list and doubly linked list is that the doubly circular linked list does not contain the NULL value in the previous field of the node.
• A linked data structure that consists of a set of sequentially linked records called nodes.

Hence, circular linked list is a link list where all nodes are connected to form a circle. there is no NULL at the end.