LEETCODE-Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {

        if (l1 == NULL)
           return l2;
        if(l2 == NULL)
           return l1;
        ListNode* scan = NULL;
        ListNode* head = NULL;
        ListNode* p1 = l1;
        ListNode* p2 = l2;
        if(p1->val <= p2->val){
           head = p1;
           p1 = p1->next;
        }
        else{
            head = p2;
            p2 = p2->next;
        }
        scan = head;
        while(p1 != NULL && p2 != NULL){
            if(p1->val <= p2->val){
                scan->next = p1;
                scan = p1;
                p1 = p1->next;
            }
            else{
                scan->next = p2;
                scan = p2;
                p2 = p2->next;
            }
        }
        while(p1 != NULL)
        {
            scan->next = p1;
            scan = p1;
            p1 = p1->next;
        }
        while(p2 != NULL)
        {
            scan->next = p2;
            scan = p2;
            p2 = p2->next;
        }
        return head;
    }
};