8. [14 pts] Implement an extractlessThan operation on a singly-linked list with

Question

8. [14 pts] Implement an extractlessThan operation on a singly-linked list with no tail pointer. Your code SHOULD NOT delete memory, only return a new LinkedList with the value less than parameter value. Your code must not call other LinkedL.ist functions. Order of the extracted nodes does not matter. Data * data //note that you can compare by calling data-3coæpare )i struct LinkNode f LinkNode next; class LinkedList f LinkNodehead; Returns a nev LinkedList that contains al1 of the LinkNodes from this * LinkedList that have node->data->compareTo(value)

Explanation / Answer

Hi. please find the answer above.. In case of any doubts, please ask in comments. If the answer helps you, please upvote. Thanks!

Related Questions

Navigate

• Browse (All)
• Browse 8
• Subjects

---

---

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