COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
In circular linked list, insertion of node requires modification of?
|
|
One pointer
|
|
|
Two pointer
|
|
|
Three pointer
|
|
|
None
|
Explanation:
Detailed explanation-1: -In a circular linked list insertion of a record requires the modification of? Answer: B) Explanation: In a circular linked list insertion of a record requires the modification of 2 pointers.
Detailed explanation-2: -So There needs modification of two pointers.
Detailed explanation-3: -For insertion of node in the beginning we need traverse the whole list. Also, for insertion and the end, the whole list has to be traversed. If instead of start pointer we take a pointer to the last node then in both the cases there won’t be any need to traverse the whole list.
Detailed explanation-4: -Two pointers are modified to insert X record.
There is 1 question to complete.