public boolean isPalindrome(Node head){
		if(head==null)
			return false;
		Stack s=new Stack();
		Node p=head;
		while(p!=null){
			s.push(p.data);
			p=p.next;
		}
		p=head;
		
		while(p!=null&!s.isEmpty()){
			if(p.data!=s.pop())
				return false;
			p=p.next;
		}
		return true;
		
	}