Merge two sorted linked lists such that the merged list is in reverse order

#include<iostream>
using namespace std;

/* Node structure of linked list node */
struct Node
{
    int data;
    struct Node* next;
};

/* Using this function we will be merging both the linked list in such a way that merged list will be in reverse order */
Node* MergeSortedReverse(Node *h1, Node *h2)
{
    if (h1==NULL && h2==NULL) return NULL;
    Node *result = NULL;
    while (h1 != NULL && h2 != NULL)
    {
        if (h1->data <= h2->data)
        {
            Node *temp = h1->next;
            h1->next = result;
            result = h1;
            h1 = temp;
        }
        else
        {
            Node *temp = h2->next;
            h2->next = result;
            result = h2;
            h2 = temp;
        }
    }
    while (h1 != NULL)
    {
        Node *temp = h1->next;
        h1->next = result;
        result = h1;
        h1 = temp;
    }
    while (h2 != NULL)
    {
        Node *temp = h2->next;
        h2->next = result;
        result = h2;
        h2 = temp;
    }

    return result;
}

/* Using this function we will be printing the linked list content */
void PrintingList(struct Node *Node)
{
    while (Node!=NULL)
    {
        cout<<Node->data<<" -> ";
        Node = Node->next;
    }
    cout<<"NULL"<<endl;
}

/* Using this function we will creating a new list node */
Node *newNode(int data)
{
    Node *temp = new Node;
    temp->data = data;
    temp->next = NULL;
    return temp;
}

int main()
{    struct Node* result = NULL;
    Node *list1 = newNode(3);
    list1->next = newNode(7);
    list1->next->next = newNode(10);
    list1->next->next->next = newNode(14);

    Node *list2 = newNode(12);
    list2->next = newNode(13);
    list2->next->next = newNode(15);
    cout<<"Original linked list 1: "<<endl;
    PrintingList(list1);
    cout<<"Original linked list 2: "<<endl;
    PrintingList(list2);
    result = MergeSortedReverse(list1, list2);
    cout<<"Merged list in reverse order: "<<endl;
    PrintingList(result);
    return 0;
}

class ReverseMerge 
{
	Node head; 
	Node a;
    Node b;

	/* Node Class */
	static class Node 
    {
        int data;
		Node next;

		Node(int d) 
        {
			data = d;
			next = null;
		}
	}
	void printlist(Node node) {
		while (node != null) {
			System.out.print(node.data + " ");
			node = node.next;
		}
	}
	Node sortedmerge(Node node1, Node node2) {
		
		// if both the nodes are null
		if (node1 == null && node2 == null) {
			return null;
		}
		// resultant node
		Node res = null;

		// if both of them have nodes present traverse them
		while (node1 != null && node2 != null) {

			// Now compare both nodes current data
			if (node1.data <= node2.data) {
				Node temp = node1.next;
				node1.next = res;
				res = node1;
				node1 = temp;
			} else {
				Node temp = node2.next;
				node2.next = res;
				res = node2;
				node2 = temp;
			}
		}
		while (node1 != null) {
			Node temp = node1.next;
			node1.next = res;
			res = node1;
			node1 = temp;
		}
		while (node2 != null) {
			Node temp = node2.next;
			node2.next = res;
			res = node2;
			node2 = temp;
		}

		return res;

	}

	public static void main(String[] args) {

		ReverseMerge list = new ReverseMerge();
		Node result = null;

		list.a = new Node(5);
		list.a.next = new Node(10);
		list.a.next.next = new Node(15);

		list.b = new Node(2);
		list.b.next = new Node(3);
		list.b.next.next = new Node(20);

		System.out.println("List a before merge :");
		list.printlist(list.a);
		System.out.println("");
		System.out.println("List b before merge :");
		list.printlist(list.b);

		// merge two sorted linkedlist in decreasing order
		result = list.sortedmerge(list.a, list.b);
		System.out.println("");
		System.out.println("Merged linked list : ");
		list.printlist(result);

	}
}

# Node of a linked list
class Node:
	def __init__(self, next = None, data = None):
		self.next = next
		self.data = data

def SortedMerge(a,b):

	if (a == None and b == None):
		return None

	res = None

	while (a != None and b != None):
	
		if (a.key <= b.key):

			temp = a.next
			a.next = res
			res = a
			a = temp

		else:
		
			temp = b.next
			b.next = res
			res = b
			b = temp
		
	while (a != None):
	
		temp = a.next
		a.next = res
		res = a
		a = temp
	
	while (b != None):
	
		temp = b.next
		b.next = res
		res = b
		b = temp
	
	return res

def printList(Node):

	while (Node != None):
	
		print( Node.key, end = " ")
		Node = Node.next
	
def newNode( key):

	temp = Node()
	temp.key = key
	temp.next = None
	return temp

res = None
a = newNode(3)
a.next = newNode(7)
a.next.next = newNode(10)
a.next.next.next = newNode(14)

b = newNode(12)
b.next = newNode(13)
b.next.next = newNode(15)

print( "Original linked list 1:")
printList(a)

print( "\nOriginal linked list 2:")
printList(b)

res = SortedMerge(a, b)

print("\nMerged list in reverse order:")
printList(res)