Vidyalelo
Data Structure · Q683

Miscellaneous on Data Structures

Programming · Data Structure · question 683

Q683

Which happens if the fast-moving pointer(hare) reaches the tail of the linked list?

A.
The other pointer points to the first node of the linked list
B.
The other pointer points to the last node of the linked list
C.
Cycle exists in the linked list
D.
No cycle exists in the linked list
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board