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
Answer / riddle
I dont think answer #8 is any recursive verion .....
Is This Answer Correct ? | 1 Yes | 2 No |
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 |
What is circular queue in data structure?
What is meant by linked list?
State the demerits of linked representation of binary trees?
Why do we use arrays?
Is learning data structures necessary?
State the properties of b tree.
what is mean by d-queue?
What is the best data structure and algorithm to implement cache?
Can a hashset contain duplicates?
Is hashmap get thread safe?
Write the advantage of separate chaining?
Can a tree be empty?