logo CodeStepByStep logo


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

Write a member function named transferEvens that could be added to the LinkedIntList class. Your function should accept a reference to a second LinkedIntList object, assumed to be an empty list, and should remove the even-indexed elements from your linked list and put them into the second separate linked list, in the same order. For example, suppose we have the following list named list1:

index   0  1  2   3  4  5  6  7   8   9
list1: {3, 1, 4, 15, 9, 2, 6, 5, 35, 89}

If the list were set up in the following way and then your method were called:

LinkedIntList list1;
LinkedIntList list2;

Then the final state of the two lists would be the following:

index   0   1  2  3   4
list1: {1, 15, 2, 5, 89}
list2: {3,  4, 9, 6, 35}

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 {
    ListNode* front;   // NULL for an empty list
    your code goes here;
Type your C++ solution code 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.