根据树的中序遍历和前序遍历，来构造树，使用递归的思想。

	TreeNode getTree(int[] preorder, int preStart, int preEnd, int[] inorder, int inStart, int inEnd) {
		if (preStart >= preEnd) {
			return null;
		}
		int cur = preorder[preStart];
		TreeNode root = new TreeNode(cur);
		int i = 0;
		int j = inStart;
		while(inorder[j] != cur) {
			j++;
			i++;
		}
		root.left = getTree(preorder, preStart + 1, preStart + i + 1, inorder, inStart, inStart + i);
		root.right = getTree(preorder, preStart + i + 1, preEnd, inorder, inStart + i + 1, inEnd);
		
		return root;
	}
    public TreeNode buildTree(int[] preorder, int[] inorder) {
    	if (preorder == null) {
    		return null;
    	}
    	int len = preorder.length;
    	return getTree(preorder, 0, len, inorder, 0, len);
    }