Match the following
How many link fields get updated in doubly linked list?
|
|
Operation |
No. of updation |
|
X. |
Inserting a node right most (while considering that the previous and next pointer of the new node are not null) |
2 |
|
Y. |
Deleting a node right most |
4 |
|
Z. |
Inserting a node elsewhere in the middle |
1 |
|
W |
Deleting a node elsewhere in the middle |
3 |
1
|
X – 3 |
|
Y – 4 |
|
Z – 2 |
|
W – 1 |
2
|
X – 3 |
|
Y – 1 |
|
Z – 4 |
|
W – 2 |
3
|
X – 4 |
|
Y – 4 |
|
Z – 2 |
|
W – 1 |
4
|
X – 3 |
|
Y – 4 |
|
Z – 1 |
|
W – 2 |