logo CodeStepByStep logo


Language/Type: C++ linked lists pointers

Write a member function named deleteBack that could be added to the LinkedIntList class. 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, your method should throw a string exception.

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;   // nullptr for an empty list

struct ListNode {
    int data;
    ListNode* next;
Type your C++ solution code here:

This is a member function exercise. 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

Need help?

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

Is there a problem? Contact a site administrator.

©, all rights reserved.