umang94

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

struct node* SortedMerge(struct node *a, struct node *b)
{
  struct node *result;
  if(a == NULL)

umang94

/*Make an interating pointer that goes forward every time till the end, and then jumps to the beginning of the opposite list, and so on. Create two of these, pointing to two heads. Advance each of the pointers by 1 every time, until they meet.*/
int FindMergeNode(Node *headA, Node *headB) 
{
    Node *p1 = headA;
    Node *p2 = headB;
    while(p1 != p2){
        p1 = p1->next;
        p2 = p2->next;
        if(p1 == NULL)
            p1 = headB;