How can one find a cycle in the linked list? IF found how
to recognize the cycle and delete that cycle?
- 12 Answers
- 18861 Views
- Citrix, I also Faced
- E-Mail Answers
Answer Posted / kamran
As far as answer 2 is concerned..it is not correct because
ptr1 and ptr2 is both pointing towards Head. and below
while loop true at first attempt and both the pointer are
still pointing toward head so at first etration condition
will be true even though there is no loop :)
The modified verision is this
bool find_cycle(Node* head){
Node* ptr1 = head;
Node* ptr2 = head->next;
while(ptr1 != NULL && ptr2 != NULL && ptr2->next != NULL)
{
if(ptr1 == ptr2){
printf("\nClycle present in thr LinkList\n");
return true;
}
ptr1 = prt1->next;
ptr2 = ptr2->next->next;
}
return false;
}
| Is This Answer Correct ? | 18 Yes | 1 No |
Post New Answer View All Answers
What are the applications of linked list?
what are the applications of Linked Lists?
What stack means?
What is a weighted graph?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
State the difference between stacks and linked lists?
What is a class user?
What is list data structure?
Is unordered_map a hash table?
How many types of arrays are there in visual basic?
How can I study data structures and algorithms?
What is binary tree example?
Why quicksort is faster?
How do you declare An array of three pointers to chars
What is a matrix? Explain its uses with an example
