Computer Sciences > Gate 2017 Set-1 > Pointer
Consider the C code fragment given below.
Assuming that m and n point to valid NULL- terminated linked lists, invocation of join will
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;
}
{
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
Correct : Pointer
Similar Questions
Consider the following C code:
#include<stdio.h>
int * assignval (int *x, int val)
{
*x = val;
return x;
}
int main()...
Consider the following C code:
#include<stdio.h>
int * assignval (int *x, int val)
{
*x = val;
return x;
}
int main()...
Consider the following C code:
#include<stdio.h>
int * assignval (int *x, int val)
{
*x = val;
return x;
}
int main()...
Total Unique Visitors
Loading......