Write a member function named reverse that could be added to the LinkedIntList class.
Your function should reverse the order of the elements in the list.
For example, if a variable named list contains {1, 8, 19, 4, 17}, then after a call of list.reverse();, it should store {17, 4, 19, 8, 1}.
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; // nullptr for an empty list
...
};
struct ListNode {
int data;
ListNode* next;
};
