C++ programming Dividing a linked list into two sublists of almost equal sizes a

Question

C++ programming

Dividing a linked list into two sublists of almost equal sizes a. Add the operation. divideMid to the class linkedListType as follows: void. divideMid (linkedListType & Sublist); This operation divides the given list into two sublists//of (almost) equal sizes.//Postcondition: first points to the first node and last//points to the last node of the first sublist.//sublist. first points to the first node//and sublist. last points to the last node of the second sublist.//Consider the following statements: unorderedLinkedList my List; unorderedLinkedList int subList; Suppose myList points to the list with elements 34 65 27 89 12 (in this order). The statement: myList divideMid (subList); dividesmyList into two sublists: myList points to the list with the elements 34 65 27, and subList points to the sublist with the elements 89 12.

Explanation / Answer

}

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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