Can someone upload code for creating two linked list then merging and sorting th

Question

Can someone upload code for creating two linked list then merging and sorting them into a third list. I need this to be in JAVA code. I have been working on code for this project for over a week and just can't seem to get it right, I have created an endless loop. The basic guidelines are below: 1. JAVA code 2. Create two linked list using a created Node class (Can't use the built in List in JAVA) 3. Create a merge/sort method to make a 3rd list containing the sorted and merged content of list 1 and 2 4. Display the new list as well as the two old list Thank you in advance.

Explanation / Answer

public static ListNode mergeSortedListIteration(ListNode nodeA, ListNode nodeB) { ListNode mergedNode ; ListNode tempNode ; if (nodeA == null) { return nodeB; } if (nodeB == null) { return nodeA; } if ( nodeA.getValue()

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.