Cycle
Also written: loop in a linked list
A linked list whose last node links back to an earlier node, so walking it never ends. Fast and slow pointers detect one because the fast pointer eventually meets the slow one.
Also written: loop in a linked list
A linked list whose last node links back to an earlier node, so walking it never ends. Fast and slow pointers detect one because the fast pointer eventually meets the slow one.