2. Assume the following ListNode class. class ListNode I public: int data; listNode* next; 1 .
Write a function that will return the sum of the data in all the nodes of the linked list. Make sure
you cover also special cases like an empty list. [8 points] class Linkedlist \{ private: ListNode*
head; public: I/ assume that the list class has the Rule-of-3 and the following function
implemented: void push_front(int x){} // add your member function with the code that will
return the sum of the data of all the nodes in the list:.
2. Assume the following ListNode class. class ListNode I public int .pdf
1. 2. Assume the following ListNode class. class ListNode I public: int data; listNode* next; 1 .
Write a function that will return the sum of the data in all the nodes of the linked list. Make sure
you cover also special cases like an empty list. [8 points] class Linkedlist { private: ListNode*
head; public: I/ assume that the list class has the Rule-of-3 and the following function
implemented: void push_front(int x){} // add your member function with the code that will
return the sum of the data of all the nodes in the list:
![2. Assume the following ListNode class. class ListNode I public: int data; listNode* next; 1 .
Write a function that will return the sum of the data in all the nodes of the linked list. Make sure
you cover also special cases like an empty list. [8 points] class Linkedlist { private: ListNode*
head; public: I/ assume that the list class has the Rule-of-3 and the following function
implemented: void push_front(int x){} // add your member function with the code that will
return the sum of the data of all the nodes in the list:](https://image.slidesharecdn.com/2-230328111219-e7fd9283/85/2-Assume-the-following-ListNode-class-class-ListNode-I-public-int-pdf-1-320.jpg)
