How can one find a cycle in the linked list? IF found how
to recognize the cycle and delete that cycle?
- 12 Answers
- 18852 Views
- Citrix, I also Faced
- E-Mail Answers
Answer Posted / chethu
Why are you guys moving both the pointers one behind the other?
You can keep a pointer at the header and traverse the other and check if it comes back to header if it does then there is a cycle else there is no cycle..
bool find_cycle(Node* head){
Node* ptr1 = head;
Node* ptr2 = head->next;
while(ptr2 != NULL && ptr2->next != NULL)
{
if(ptr1 == ptr2){
printf("\nClycle present in thr LinkList\n");
return true;
}
ptr2 = ptr2->next->next;
}
return false;
}
This should be more efficient.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
What is the best case for bubble sort?
What is adt example?
Define heap order property?
Which one is the simplest sorting in data structure?
Which is better arraylist or linkedlist?
Why is hashing used?
Can we extend an array after initialization?
Why do we need to use computers to help us sort lists?
What is a hash in programming?
Why do we use different types of data structures?
What is data structure geeksforgeeks?
Does arraylist contain duplicates?
Which sorting technique is best?
How do you sort pseudocode?
What is the height of binary tree?
