logo CodeStepByStep logo

consume

Language/Type: C++ linked lists pointers
Author: Marty Stepp (on 2016/06/16)

Write a member function named consume that could be added to the LinkedIntList class. Your function should accept as a parameter a reference to another LinkedIntList and not return anything. After the call is done, all the elements from the second list should be appended to the end of the first one in the same order, and the second list should be empty. Note that either linked list can be empty. For example, if we start with the following two lists below, we would receive the following results:

lists
list1: {1, 3, 5, 7}
list2: {2, 4, 6}
after list1.consume(list2);
list1: {1, 3, 5, 7, 2, 4, 6}
list2: {}
after list2.consume(list1);
list1: {}
list2: {2, 4, 6, 1, 3, 5, 7}

Constraints: Do not call any methods of the LinkedIntList class. Do not construct any new ListNode objects in solving this problem (though you may create as many ListNode* pointer variables as you like). Do not use any auxiliary data structures to solve this problem (no array, vector, stack, queue, string, etc).

Write the member function as it would appear in LinkedIntList.cpp. You do not need to declare the function header that would appear in LinkedIntList.h. Assume that you are adding this method to the LinkedIntList class as defined below:

class LinkedIntList {
private:
    ListNode* front;   // NULL for an empty list
    ...
    
public: 
    your code goes here;
};
Type your solution here:


This is a member function problem. Submit a member function that will become part of an existing C++ class. You do not need to write the complete class, just the member function described in the problem.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.