logo CodeStepByStep logo

Main Page → Exercises → C++ → Solve an Exercise

linkedListMystery2

Language/Type: C++ linked lists pointers

Consider the following linked list of ListNode objects, with a pointer named front that points to the first node: 

front -> [1] -> [2] -> [4] -> [3] -> [5] -> [7] -> [11] -> [0] -> [6] -> [1] -> [1] /

Write the state of the linked list after the following code runs on it. If a given node is removed from the list, you don't need to draw that node, only the ones that remain reachable in the original list. Write your answer in this format, without the quotes: "front -> 10 -> 20 -> 30 /". 

void linkedListMystery2(ListNode*& front) {
    ListNode* curr = front;
    ListNode* prev = nullptr;
    while (curr->next != nullptr) {
        if (curr->data % 2 == 0 && prev != nullptr) {
            prev->next = curr->next;
        } else {
            curr->data--;
        }
        prev = curr;
        curr = curr->next;
    }
}
list state

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.