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: Option D
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Join The Discussion