Linked List in Java - 70: Merge Two Sorted Linked Lists in Reverse order

Merge Two Sorted Linked Lists in Reverse order:
- Start iteration from head of both linked lists & compare values of nodes
- Take a resultant list with starting node as null
- Now, while comparing nodes of both linked list, add smaller node in front of resultant list.
- Always add node in front of resultant lists
- At last, you'll have list in reverse or descending order.

Please check video for more info:

CHECK OUT CODING SIMPLIFIED

★☆★ VIEW THE BLOG POST: ★☆★

I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 200+ videos.

★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★

★☆★ Send us mail at: ★☆★

This problem is similar to following:
Merge Two Sorted Linked Lists in Reverse order,
Merge Two Sorted Linked Lists in Reverse order in java,
Merge,
two sorted list,
reverse order,
linked list,
java tutorial,
coding simplified,
java