Merge Two Sorted Lists

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        ListNode root = null;
        ListNode next = null;
        while(l1 != null && l2 != null) {
            if(l1.val < l2.val) {
                if(root == null) {
                    root = l1;
                    next = root;
                }else {
                    next.next = l1;
                    next = l1;
                }
                l1 = l1.next;
            }else {
                if(root == null) {
                    root = l2;
                    next = root;
                }else {
                    next.next = l2;
                    next = l2;
                }
                l2 = l2.next;
            }
        }
        next.next = (l1 == null) ? l2 : l1;
        return root;
    }