Question

in a singly circular linked list how many address fields are there​

Answer 1

Answer:

Traverse linked list using two pointers. Move one pointer(slow_p) by one and another pointer(fast_p) by two. If these pointers meet at the same node then there is a loop. If pointers do not meet then linked list doesn't have a loop.

Explanation:

$hope \: this \: helps \: you$

Answer 2

2

Each node in a circular linked list is made up of two parts, just like in a singly linked list. The first portion is known as the data or information part, while the second portion is known as the link field, which carries the address of the next node or is null. Only one addition reference labelled 'Next' exists in a single circular list. Except for the last node, each node's 'Next' will carry the address of the next node. The address of first node will be stored in the 'Next' field of the last node.