GATE 2006-IT
December 14, 2023Programming
December 14, 2023GATE 1987
| Question 25 |
In a circular linked list organisation, insertion of a record involves modification of
| One pointer. | |
| Two pointers. | |
| Multiple pointers. | |
| No pointer. |
Question 25 Explanation:
Suppose we have to insert node p after node q then
p → next = q → next
q → next = p
So, two pointers modifications.
p → next = q → next
q → next = p
So, two pointers modifications.
Correct Answer: B
Question 25 Explanation:
Suppose we have to insert node p after node q then
p → next = q → next
q → next = p
So, two pointers modifications.
p → next = q → next
q → next = p
So, two pointers modifications.