Recursive function to merge two sorted Linked Lists.

SortedMergeLL.cpp

struct node
{
  int data;
  struct node *next;
};

struct node* SortedMerge(struct node *a, struct node *b)
{
  struct node *result;
  if(a == NULL)
    return b;
  if (b == NULL)
    return a;
  if (a ->data <= b->data)
  {
    result = a;
    result->next = SortedMerge(a->next, b);
  }
  else
  {
    result = b;
    result->next = SortedMerge(a,b->next);
  }
  return result;
}