Question
The following is a question from C++ Plus Data Structures 5 ed. I am assuming I start with code from book, but im not sure.
The following is a question from C++ Plus Data Structures 5 ed.
I am assuming I start with code from book, but im not sure.
Write a client function that merges two instances of the Sorted List ADT using the following specification.
MergeLists(SortedType list1, SortedType list2, SortedType& result)
Function: Merge two sorted lists into a third sorted list.
Preconditions: list1 and list2 have been initialized and are sorted by key using function ComparedTo.
list1 and list2 do not have any keys in common.
Postconditions: result is a sorted list that contains all of the items from list1 and list2.
Write the function definition, using a linked implementation.
In order to verify that the code of MergeLists(SortedType list1, SortedType list2, SortedType& result) works, please integrate your code in the SortedType code in the book pages 239-243.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started