If the address part of the node contains the header address then cycle is

How can one find a cycle in the linked list? IF found how
to recognize the cycle and delete that cycle?

Question Posted / kannan

Answer Posted / kannan

If the address part of the node contains the header address
then cycle is formed Is it so...

Is This Answer Correct ?

21 Yes

16 No

Please Help Members By Posting Answers For Below Questions

Does treeset allow null values?

897

State the difference between arrays and linked lists?

1004

Does arraylist have a tostring?

899

What are the main differences between the linked list and linear array?

981

Why using cookie to store session info is a better idea than just using session info in the request?

944

Which sorting algorithm is best for large data?

890

What is a singletonlist?

890

What is array sort?

894

What are the categories of avl rotations?

995

Is arraylist better than array?

955

Construct a doubly linked list using a single pointer in each node?

948

What is the difference between adt and data structure?

1012

Why sorting is done?

879

What is difference between concurrenthashmap and hashtable?

933

What is the minimum number of queues that can be used to implement a priority queue?

957