How to merge two sorted lists into a reverse-ordered list in C++

#include<iostream>
#include "Node.h"
using namespace std;
/*merges two linked lists sorted in asc. order
    into a resultant list sorted in desc. order.
  @param headList1 pointer to list1 sorted in asc. order
  @param headList2 pointer to list2 sorted in asc. order
  @return pointer to merged list in desc. order
*/
Node *merge(Node *headList1, Node *headList2){
  Node *headList3 = nullptr;
  Node *currentList1 = headList1, *currentList2 = headList2;
  /*until either or both linked lists are empty, find the smallest
  element from list1 and list2 , remove it and insert it at the head
  of list 3. This will create a desc. order list.*/
  while(currentList1 != nullptr && currentList2 != nullptr){
    if(currentList1->data < currentList2->data){
      Node *nextCurrent = currentList1->next;
      currentList1->next = headList3;
      headList3 = currentList1;
      currentList1 = nextCurrent;
    } else {
      Node *nextCurrent = currentList2->next;
      currentList2->next = headList3;
      headList3 = currentList2;
      currentList2 = nextCurrent;
    }
  }
  /*until list1 is empty, remove element from list1 and insert it at the head
  of list 3*/
  while(currentList1 != nullptr){
    Node *nextCurrent = currentList1->next;
    currentList1->next = headList3;
    headList3 = currentList1;
    currentList1 = nextCurrent;
  }
   /*until list2 is empty, remove element from list1 and insert it at the head
  of list 3*/
  while(currentList2 != nullptr){
    Node *nextCurrent = currentList2->next;
    currentList2->next = headList3;
    headList3 = currentList2;
    currentList2 = nextCurrent;
  }
  return headList3;
}
// list1 values in asc. order
int valuesList1[] = {1,3,5,7,9};
int lengthList1 = 5;
// list2 values in asc.order
int valuesList2[] = {2,4,6,8};
int lengthList2 = 4;