GATE Computer Science (CS) 2017 Shift 1 Solved Paper

Question : 18 of 65

Marks: +1, -0

Consider the C code fragment given below. typedef struct node {int data; node* next;} node;


void join (node* m, node* n) {node* p = n;
while (p- >next! = NULL) {
p = p - > next;
}
p - > next = m;
}

Assuming that m and n point to valid NULL-terminated linked lists, invocation of join will

Go to Question:

Prev Question

Next Question