Question

In a ___________ linked list, the last node contains the pointer of the first node.

options:

1.Single

2.Double

3.Circular

4.None of the above

​

Answer 1

Answer:

In a Circular linked list, the last node contains the pointer of the first node.

Explanation:

Different nodes are produced dynamically in a circular linked list, and their addresses may or may not be contiguous. The address of the next node in the linked list is stored in the link section of the node. The address of the initial node will be found in the list's last node. A pointer named start pointer points to the first node in a linked list, while a pointer called end pointer points to the last node.