using System.Collections.Generic;
public ListNode(T data, ListNode<T> next)
public static ListNode<int> search (ListNode<int> l, int key)
while (l != null && l.data != key)
public static ListNode<int> MergeSorted(ListNode<int> L1, ListNode<int> L2)
ListNode<int> p1 = L1, p2 = L2;
ListNode<int> dummyHead = new ListNode<int>(0, null);
ListNode<int> current = dummyHead;
while (p1 != null && p2 != null)
else if (p1.data > p2.data)
current.next = p1 != null ? p1 : p2;
public static void Main()
Console.WriteLine("Hello World");