Answered: initially empty (i.e., zHead initially…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Concept explainers

Question

Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list and Z-list, respectively, from here). X-list and Y-list are each sorted (in non-decreasing order) in itself and each may be empty. Z-list is initially empty (i.e., zHead initially contains the null pointer). Develop and test a recursive C++ function called SortedMergeRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list – X-list and Y-list should both be empty after the call.

Other specifications/requirements:

●

Each node of the list has the following structure:

struct Node
{
int data;
Node *link;
};

●

The function should:

►

Have only three parameters (each a pointer-to-Node) and no return value (be a void function).

►

Not use any global variables or static local variables.

►

Not use any looping constructs (for, while, do-while, ...).

►

Be directly (not indirectly) recursive.

►

Not create any new nodes, destroy any existing nodes or copy/replace the data item of any node.

►

Not make temporary copies of the data involved using any other storage structures (arrays, stacks, queues, etc.).

►

Use (if ever needed) no more than a small number of pointers to hold certain link addresses.

○

Not make temporary copies of the entire list's link addresses wholesale.

●

Z-list should be sorted at all times as it "grows" from an empty list to one that contains all the nodes originally contained in X-list and Y-list.

►

What this means is that you should not, for instance, attempt to first append all the nodes in X-list to Z-list, then append all the nodes in Y-list to Z-list, and finally use a sorting algorithm of some kind to sort the nodes in Z-list.

Fill in the prototype for SortedMergeRecur in the supplied header file.

●

Fill in the definition for SortedMergeRecur in the supplied implementation file.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.

Similar questions