@@ -0,0 +1,517 @@
+/*%0A  Insert Node at the end of a linked list%0A  head pointer input could be NULL as well for empty list%0A  Node is defined as%0A  class Node %7B%0A     int data;%0A     Node next;%0A  %7D%0A*/%0A%0ANode MergeLists(Node list1, Node list2) %7B%0A  if (list1 == null) %7B return list2; %7D%0A  if (list2 == null) %7B return list1; %7D%0A%0A  Node head = null;%0A%0A  if (list1.data %3C= list2.data) %7B%0A    head = list1;%0A    head.next = MergeLists(list1.next, list2);%0A  %7D else %7B%0A    head = list2;%0A    head.next = MergeLists(list1, list2.next);%0A  %7D%0A%0A  return head;%0A%7D%0A

solve merge two sorted linked lists