Merge 2 sorted linked list in reverse order

PROBLEM :

Given two linked lists sorted in increasing order. Merge them such a way that the result list is in decreasing order. Both the Linked list can be of different sizes.

Input:
You have to complete the method which takes 2 argument: the head of the first linked list  and the head of second linked list. You should not read any input from stdin/console. There are multiple test cases. For each test case, this method will be called individually.

Output:
Your function should return a pointer to the list obtained by merging the two sorted linked list passed as argument.

Constraints:
1 <=T<= 50
1 <= size of linked lists <= 1000

Example:
Input:
2
4 3
5 10 15 40
2 3 20
2 2
1 1
2 4


Output:
40 20 15 10 5 3 2
4 2 1 1

--------------------------------------------------------------------------------
SIMPLE c++ IMPLEMENTATION :
--------------------------------------------------------------------------------

/*

The structure of linked list is the following

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

*/

struct Node * mergeResult(Node *node1,Node *node2)
{
    struct Node *n1,*n2,*temp,*merge,*ptr ;
    merge=NULL ;
    n1=node1 ;
    n2=node2 ;
   
    while(n1!=NULL&&n2!=NULL)
    {
        temp=(struct Node*)malloc(sizeof(struct Node)) ;
        temp->next=NULL ;
       
        if(n1->data<n2->data)
        {
            temp->data=n1->data ;
            n1=n1->next ;
        }
        else
        {
            temp->data=n2->data ;
            n2=n2->next ;
        }
       
        if(merge==NULL)
            merge=temp ;
        else
        {
            ptr=merge ;
            while(ptr->next!=NULL)
                ptr=ptr->next ;
            ptr->next=temp ;
        }
    }
   
    if(n1!=NULL)
    {
        if(merge==NULL)
            merge=n1 ;
        else
        {
            ptr=merge ;
            while(ptr->next!=NULL)
                ptr=ptr->next ;
            ptr->next=n1 ;
        }
    }
   
    if(n2!=NULL)
    {
        if(merge==NULL)
            merge=n2 ;
        else
        {
            ptr=merge ;
            while(ptr->next!=NULL)
                ptr=ptr->next ;
            ptr->next=n2 ;
        }
    }
   
    struct Node *one,*two,*third ;
    one=merge ;
    two=one->next ;
    third=two->next ;
   
    one->next=NULL ;
    two->next=one ;
   
    while(third!=NULL)
    {
        one=two ;
        two=third ;
        third=third->next ;
       
        two->next=one ;
    }
    merge=two ;
    return merge ;
}

---------------------------------------------------------------------------------