C++

Your assignment this week is to work with linked lists. In order to pass all the tests it is important to understand how and when to check for the end condition of a linked list. You will write a function int addLists(Node* listA, Node* listB). The two linked lists represent numbers, where each element in the list is a digit with the least significant number in the first link position ie: the number 1234 will be represented as list->4 ->3 -> 2->1. Youre job is to add the two numbers and return the sum. There is 25 points available in the tests, the tests will check if you correctly return the sum when the two numbers are relatively close in size, when A is much bigger than B and vice versus. Not tested but available for 5pts extra credit is if you write a recursive algorithm to traverse the lists that sums the numbers recursively (that means no global variables, the accumulate must be based on and returned in the recursive call)

Node.h

#include class Node { public: int data; Node* next; Node(int data, Node* next=nullptr); };

Node.cpp

#include "Node.h" #include using namespace std; Node::Node(int t_data, Node* t_next) { data = t_data; next = t_next; }

main.cpp

#include #include #include #include "Node.h" using namespace std; typedef unsigned int uint; void printList(Node* list) { while (list != nullptr) { cout << list->data << " "; list = list->next; } cout< 0) { listIterator->next = new Node(number%10); listIterator = listIterator->next; number = number/10; } return headOfList; } int main() { srand(time(NULL)); int numA = rand()%10000000; int numB = rand()%10000000; Node* listA = genList(numA); Node* listB = genList(numB); int sum = addLists(listA, listB); if ( sum == (numA + numB)) { cout<<"PASSED basic test (9 pts)"<