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

Define a tree?

1040

State the different types of linked lists?

994

What do you mean by structure property in a heap?

1126

What is an acyclic graph?

1086

Can a tree be empty?

936

What is a matrix? Explain its uses with an example

1254

What are hash tables good for?

955

What are the advantages of sorting?

995

Which is faster hashset or treeset?

1070

Which interface provides the capability to store objects using a key-value pair?

1168

Why merge sort is better than insertion sort?

874

What is the quickest sorting algorithm?

1004

How does a treemap sort?

887

Explain the term binding time?

1006

Can we give size to arraylist?

1020