public Node merge(Node left, Node right)
	{
		Node merged = null;
		Node node = null;
		if(left == null)
		{
			merged = right;
			return merged;
		}
		else if (right == null)
		{
			merged = left;
			return merged;
		}
		if(left.data < right.data)
		{
			merged = left;
			node = left;
			left = left.next;
		}
		else
		{
			merged = right;
			node = right;
			right = right.next;
		}
		while (left != null && right != null)
		{
			if(left.data < right.data)
			{
				merged.next = left;
				left = left.next;
			}
			else
			{
				merged.next = right;
				right = right.next;
			}
			merged = merged.next;
		}
		if (left != null)
		{
			merged.next = left;
		}
		if (right != null)
		{
			merged.next = right;
		}
		return node;
	}