Data Structures Question:
Tell how to check whether a linked list is circular ?
Answer:
Create two pointers, each set to the start of the list. Update each as follows:
while (pointer1)
{
pointer1 = pointer1->next;
pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next;
if (pointer1 == pointer2)
? ? ? ? ? ? {
print (”circularn”);
}
}
while (pointer1)
{
pointer1 = pointer1->next;
pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next;
if (pointer1 == pointer2)
? ? ? ? ? ? {
print (”circularn”);
}
}
| Previous Question | Next Question |
| What is placement new in data structures? | What is the difference between ARRAY and STACK in Data Structures? |