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

Answers were Sorted based on User's Feedback



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

Answer / riddle

I dont think answer #8 is any recursive verion .....

Is This Answer Correct ?    1 Yes 2 No

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

Answer / rajdeep...

void cycle_detect(struct node *head)
{
struct node *ptr1=head;
struct node *ptr2=head;
while(ptr1!=NULL && ptr1->next!=ptr2)
{
ptr1=ptr1->next;
}
if(ptr1->next==ptr2)
{
printf("the list contains cycle");
}
else
{
printf("the list don't contain cycle");
}
}

Is This Answer Correct ?    6 Yes 16 No

Post New Answer

More Data Structures Interview Questions

What is circular queue in data structure?

0 Answers  


What is meant by linked list?

0 Answers  


State the demerits of linked representation of binary trees?

0 Answers  


Why do we use arrays?

0 Answers  


Is learning data structures necessary?

0 Answers  


State the properties of b tree.

0 Answers  


what is mean by d-queue?

11 Answers  


What is the best data structure and algorithm to implement cache?

0 Answers   Adobe,


Can a hashset contain duplicates?

0 Answers  


Is hashmap get thread safe?

0 Answers  


Write the advantage of separate chaining?

0 Answers  


Can a tree be empty?

0 Answers  


Categories