ISRO2018-79

Question

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 segment 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?

1. X$\rightarrow$Bwd$\rightarrow$Fwd = X$\rightarrow$Fwd; X$\rightarrow$Fwd$\rightarrow$Bwd = X$\rightarrow$Bwd;
2. X$\rightarrow$Bwd.Fwd = X$\rightarrow$Fwd; X.Fwd$\rightarrow$Bwd = X$\rightarrow$Bwd;
3. X.Bwd$\rightarrow$Fwd = X.Bwd; x$\rightarrow$Fwd.Bwd = X.Bwd;
4. X$\rightarrow$Bwd$\rightarrow$Fwd = X$\rightarrow$Bwd; X$\rightarrow$Fwd$\rightarrow$Bwd = X$\rightarrow$Fwd;

Comments

option A is correct

---

i think option A is correct.

Answer 1

X $\rightarrow$ Bwd $\rightarrow$ Fwd = X $\rightarrow$ Fwd
X → Fwd → Bwd = X → Bwd

Option A is correct. 

Answer 2

Option A is correct.