• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

ISRO | ISRO CS 2018 | Question 19

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;

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments