private static boolean isPalindrome(LinkedList node){
		boolean isPal = true;
		length += node.getData().length;
		if(node.getNode()!=null){
			isPal = isPal && isPalindrome(node.getNode());
		}
		if(isPal || node.getNode()==null){
			char[] headData = head.getData();
			char[] iterData = node.getData();
			int headLength = headData.length;
			for(int j=0;;headIndex++, j++){
				if(noOfComp >= LinkedListPractice.length/2){
					return isPal;
				}
				if(headLength-1 < headIndex){
					headIndex = 0;
					head = head.getNode();
					headData = head.getData();
					headLength = headData.length;
				}
				if(iterData.length-1 < j){
					return true;
				}
				noOfComp++;
				if(headData[headIndex] != iterData[iterData.length-1-j]){
					return false;
				}
			}
		}
		return isPal;
		
	}