merge two sorted lists

public class Solution{
	public ListNode mergeTwoSortedLists(ListNode l1 , ListNode l2){
		if(l1 == null)
		return l2;
		
		if(l2 == null)
		return l1;
		
		ListNode MergeHead = null;
		if(l1.val < l2.val){
			MergeHead = l1;
			MergeHead.next = mergeTwoSortedLists(l1.next,l2);
		}else{
			MergeHead = l2;
			MergeHead.next = mergeTwoSortedLists(l1,l2.next);
		}
		return MergeHead;
	}
}