How can we remove loops in a linked list? What are the functions of fast and slow pointers?
- 1 Answers
- 1310 Views
- I also Faced
- E-Mail Answers
Answer Posted / Vishwash Kumar Singh
To detect and remove a loop in a linked list, use Floyd's cycle-finding algorithm. This method uses two pointers: a fast pointer (covering more nodes at each step) and a slow pointer (covering one node at each step). If there is a loop, the fast pointer will meet the slow pointer at some point in the loop. To remove the loop, modify the linked list such that the last node of the loop points to null.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Write a program for Sorting an Array. Which sorting will you prefer?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Can you declare an array without assigning the size of an array?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
What sort of serious problems have you experienced, and how have you handled them?
