public TreeNode readPreAndInRec(String[] preorder, String[] inorder,int preStart, int preEnd, int inStart, int inEnd)
	{
		if(preStart > preEnd || inStart > inEnd)
		{
			return null;
		}
		else
		{			
			int indexInPreorder = IndexOfString(preorder[preStart], inorder);
			TreeNode rootNode = new TreeNode(preorder[preStart]);
			
			rootNode.setLeft(readPreAndInRec(preorder, inorder, preStart+1, indexInPreorder, inStart, indexInPreorder-1));	// Left side
			rootNode.setRight(readPreAndInRec(preorder, inorder, indexInPreorder+1, preEnd, indexInPreorder+1, inEnd)); // Right side
			//rootNode.setLeft(readPreAndInRec(preorder, inorder, preStart, indexInPreorder-1, inStart+1, inEnd + indexInPreorder - indexInPreorder));	// Left side
			//rootNode.setRight(readPreAndInRec(preorder, inorder, indexInPreorder+1, preEnd, inStart + indexInPreorder - preStart + 1, inEnd)); // Right side
			
			return rootNode;
		}
	}