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 |
Is hashmap an object?
What is bubble sort and quick sort?
Which sorting algorithm has minimum number of swaps?
Define the queue data structure.
What is the difference between arrays sort and collections sort?
Differentiate linear from non linear data structure?
Define primary data structures?
What are linked list?
What is difference between data type and data structure?
Define a complete binary tree?
How can someone display singly linked list from first to last?
Explain implementation of traversal of a binary tree.