public Node merge()
	{
		System.out.println("size is --"+this.size());
		if(this.size()%2!=0)
			return null;
		Node p1, p2, r=null;
		p1 = this;
		p2 = this;
		Node p3=this;
		while(p1.next!=null && p1.next.next!=null)
		{
			p1=p1.next.next;
			p2=p2.next;
		}
		System.out.println("mid is-->"+p2.data);
		int i = 0;
		while(p2.next!=null)
		{
			if(i%2==0)
			{
				r.addNode(p3);
				p3=p3.next;
			}	
			else {r.addNode(p2);
			p2=p2.next;
			}
			i=i+1;
		}

return r;
	}