A doubly linked list is declared as
struct Node { int Value; struct Node *Fwd; struct Node *Bwd;);
Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly linked list, if it is assumed that X points to neither the first nor the last node of the list?
(A) X->Bwd->Fwd = X->Fwd; X->Fwd->Bwd = X->Bwd ;
(B) X->Bwd.Fwd = X->Fwd ; X.Fwd->Bwd = X->Bwd ;
(C) X.Bwd->Fwd = X.Bwd ; X->Fwd.Bwd = X.Bwd ;
(D) X->Bwd->Fwd = X->Bwd ; X->Fwd->Bwd = X->Fwd;
Home Modern › Forums › ISRO › A doubly linked list is declared as Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly linked list, if it is assumed that X points to neither the first nor the last node of the list? (A) X->Bwd->Fwd = X->Fwd; X->Fwd->Bwd = X->Bwd ; A doubly linked list is declared as Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly linked list, if it is assumed that X points to neither the first nor the last node of the list? (A) X->Bwd->Fwd = X->Fwd; X->Fwd->Bwd = X->Bwd ;struct Node { int Value; struct Node *Fwd; struct Node *Bwd;);
(B) X->Bwd.Fwd = X->Fwd ; X.Fwd->Bwd = X->Bwd ;
(C) X.Bwd->Fwd = X.Bwd ; X->Fwd.Bwd = X.Bwd ;
(D) X->Bwd->Fwd = X->Bwd ; X->Fwd->Bwd = X->Fwd;struct Node { int Value; struct Node *Fwd; struct Node *Bwd;);
(B) X->Bwd.Fwd = X->Fwd ; X.Fwd->Bwd = X->Bwd ;
(C) X.Bwd->Fwd = X.Bwd ; X->Fwd.Bwd = X.Bwd ;
(D) X->Bwd->Fwd = X->Bwd ; X->Fwd->Bwd = X->Fwd;
nan