Question: C++ and data structure. please show me all the work!!! 1.(50 points) Implement an Unsorted List ADT using a linked list implementation with an extension
C++ and data structure.
please show me all the work!!!
1.(50 points) Implement an Unsorted List ADT using a linked list implementation with an extension of ADT with function SplitLists (Exercise 3 from Chapter 3, p. 185). Keep the function names the same as in Unsorted List ADT in Chapter 3.
SplitLists function requirements:
SplitLists(UnsortedType list, ItemType item, UnsortedType& list1, UnsortedType& list2)
Function: divides list into two lists according to the key of item
Preconditions: list has been initialized and is not empty
Postconditions: list1 contains all the items of list whose keys are less than or equal to items key; list2 contains all the items of list whose keys are greater than items key
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
