Merge two sorted linked list and print in reverse order

Problem: For two given sorted linked list, obtain one merged linked list and display in reverse order

Problem Explanation: For two given linked list 10 -> 20 -> 30 and 26 -> 32 -> 34,  10 -> 20 -> 26 -> 30 -> 32 -> 34 is the merged linked list.

Hence, output is 34 -> 32 -> 30 -> 26 -> 20 -> 10. Similarly, for linked lists 5 -> 20 and 10 -> 15 -> 25, 5 -> 10 -> 15 -> 20 -> 25 is the merged linked list.

Hence, 25 -> 20 -> 15 -> 10 -> 5 is the output.

Java Implementation

public class MergeSortedLL {
public Node mergeReverseLL(Node first, Node second) {
Node resultant = null, prev = null;
if (first == null && second == null) {
return null;
}

while (first != null && second != null) {
prev = resultant;
if (first.getValue() < second.getValue()) {
resultant = new Node(first.getValue(), prev);
} else {
resultant = new Node(second.getValue(), prev);
}
}

while (first != null) {
prev = resultant;
resultant = new Node(first.getValue(), prev);
}

while (second != null) {
prev = resultant;
resultant = new Node(second.getValue(), prev);
}

return resultant;
}

public void printLL(Node node) {
while (node != null) {
System.out.println(node.getValue());
}
}

public static void main(String[] args) {
Node first = new Node(10, null);

Node second = new Node(26, null);

MergeSortedLL mergeSortedLL = new MergeSortedLL();
mergeSortedLL.printLL(mergeSortedLL.mergeReverseLL(first, second));

}

public class Node {
private int value;

public Node(int value, Node n) {
this.value = value;
}

public int getValue() {
return value;
}

public void setValue(int value) {
this.value = value;
}

public Node getLink() {