Interested to Buy Any Domain ? << Click Here >> for more details...
How can one find a cycle in the linked list? IF found how
to recognize the cycle and delete that cycle?
- 12 Answers
- 22617 Views
- Citrix, I also Faced
- E-Mail Answers
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 the minimization factor and time complexity of b-tree?
Who invented merge sort?
Define 2-3-4 tree?
Which sorting is stable?
Describe avl tree or height balanced binary search tree.
Differentiate between failfast and failsafe.
What is difference between for loop and foreach?
What is a map programming?
Why is data structure important?
Is array immutable?
How does a selection sort work?
How do you replace an element in an arraylist?
Windows 
