Add Two Numbers

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)

Output: 7 -> 0 -> 8

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        ListNode* node = NULL;
        ListNode* head = NULL;
        ListNode* prev = NULL;
        int carry = 0;
        int sum   = 0;

        while (l1 != NULL || l2 != NULL)
        {
            if (l1 != NULL && l2 != NULL)
            {
                sum += (l1->val + l2->val);
                l1 = l1->next;
                l2 = l2->next;
            }
            else if (l1 != NULL)
            {
                sum += l1->val;
                l1 = l1->next;
            }
            else
            {
                sum += l2->val;
                l2 = l2->next;
            }

            carry = sum / 10;
            sum   = sum % 10;

            node = new ListNode(sum);
            if (NULL == head)
            {
                head = node;
            }
            else
            {
                prev->next = node;
            }
            prev = node;
            
            sum = carry;
        }

        if (sum != 0)
        {
            prev->next = new ListNode(sum);
        }
        
        return head;
    }
};