. Design a C++ program which reads any number of integers in sorted order in two...

 

Transcribed Image Text:

. Design a C++ program which reads any number of integers in sorted order in two seperate linked lists until "-1"'s are entered. Your program must then construct and print a new, merged, sorted list out of the seperate lists. Enter first list: 10 30 36 42 56 66 98-1 Enter second list: 9 13 15 23 32 33 41 45 52 -1 Merged list: 9->10->13->15->23->30->32->33->36->41->42->45->52->56->66->98->NULL . Design a C++ program which reads any number of integers in sorted order in two seperate linked lists until "-1"'s are entered. Your program must then construct and print a new, merged, sorted list out of the seperate lists. Enter first list: 10 30 36 42 56 66 98-1 Enter second list: 9 13 15 23 32 33 41 45 52 -1 Merged list: 9->10->13->15->23->30->32->33->36->41->42->45->52->56->66->98->NULL

Answer rating: 100% (QA)

Here is an example of a C program that reads two separate linked lists of integers in sorted order and merges them into a new sorted list cpp include ... View the full answer