Question: PLEASE DO THIS PROGRAM DO NOT GIVE ME A SAMPLE!! PLEASSSSEEE! Implement an Unsorted List ADT using a linked list implementation with an extension of

PLEASE DO THIS PROGRAM DO NOT GIVE ME A SAMPLE!! PLEASSSSEEE!

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

a. Implement SplitLists as an array-based member function of the Unsorted List ADT.

b. Implement SplitLists as a linked member function of the Unsorted List ADT.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!