struct node
{
int data;
node *next;
};
struct node* sortedmerge(struct node* node1, struct node* node2)
{
struct node* merging = NULL;
counter++;
if (node1 == NULL)
return(node2);
else if (node2==NULL)
return(node1);
//picking smaller node and recurring
if (node1->data <= node2->data)
{
merging = node1;
merging->next = sortedmerge(node1->next, node2);
}
else
{
merging = node2;
merging->next = sortedmerge(node1, node2->next);
}
return(merging);
}
i want to know what will this code return and if i declare smtn like
node**headref=sortedmerge(list1,list2)..
what will be the value or stored in *hadref?????