GATE 2017 CSE DATA STRUCTURE | typedef struct node | join(node* m, node*n) { node*p=n; | LINKED LIST
GATE | GATE-CS-2017 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
(A) append list m to the end of list n for all inputs
(B) either cause a null pointer dereference or append list m to the end of list n
(C) cause a null pointer dereference for all inputs.
(D) append list n to the end of list m for all inputs.
Gate cse
Linked list
For any queries feel free to comment or direct message on Instagram
Instagram - / jatingupta5jan
Playlist link -
C Programming - • C PROGRAMMING |GATE CS/IT PYQ | PREV...
Time Complexity - • GATE CS/IT PYQ TIME COMPLEXITY | ALGO...
Data structure - • GATE CS/IT (PYQ) | DATA STRUCTURES |...
Algorithms - • GATE CS/IT (PYQ) ALGORITHMS | TIME CO...
Binary tree - • GATE CS/IT CSE PYQ| BINARY TREE | DAT...
Linked List - • GATE CS/IT CSE PYQ | LINKED LIST | DA...
#jatin_gupta_gate