logo CodeStepByStep logo

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

deleteBack

Language/Type: C++ linked lists pointers

Write a function named deleteBack that accepts a pointer to a ListNode representing the front of a linked list. Your function should delete the last value (the value at the back of the list) and return the deleted value. If the list is empty (nullptr), your function should throw a string exception.

Constraints: 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). Do not modify the data field of existing nodes; change the list by changing pointers only.

Assume that you are using the ListNode structure as defined below: 

struct ListNode {
    int data;         // value stored in each node
    ListNode* next;   // pointer to next node in list (nullptr if none)
}
Function: Write a C++ function as described, not a complete program.

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.