Merge two sorted linked lists
Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which is in increasing order. SortedMerge() should return the new list. The new list should be made by splicing
together the nodes of the first two lists.

Runtime Error:
Runtime ErrorSegmentation Fault (SIGSEGV)
Learn More about Seg Fault

```
Node* SortedMerge(Node* head1,   Node* head2)
{
    struct Node *result;
   // Node *temp;
   if(head1==NULL)
      return head2;
  if(head2==NULL)
     return head1;
  if(head1->data<=head2->data)
  {
      result->data=head1->data;
     //result=head1;
      result->next=SortedMerge( head1->next,   head2);

  }
  else if(head1->data>head2->data)
  {
       result->data=head2->data;
      //     result=head2;
      result->next=SortedMerge( head1,   head2->next);

  }

  else
  {
      return NULL;

  }

    return result;
    // Your Code Here
}

```

iam getting segmentation fault . why?