根据树的先序中序后序建立二叉树

思路：根据树先序中序后序的遍历特点，先找到根节点，再利用根节点去拆分左子树和右子树，递归的进行下去即可

import java.util.Arrays;

public class BuildTreeByOrders {
	//根据先序和中序建立二叉树
    static TreeNode BuildTree2(int[] preorder,int[] inorder) {
    	if(preorder.length==0||inorder.length==0) return null;
    	int x = preorder[0];//根据先序找到根节点
    	TreeNode root = new TreeNode(x);
    	int pos = 0;
    	for (int i = 0; i < inorder.length; i++) {//在中序中找到分割点
			if(inorder[i]==x) {
				pos = i;break;
			}
		}
    	//将先序与中序的左子树部分继续递归得到左子树
    	int[] leftpreorder = Arrays.copyOfRange(preorder, 1,pos+1);
    	int[] leftinorder = Arrays.copyOfRange(inorder, 0,pos);
    	root.left = BuildTree2(leftpreorder, leftinorder);
    	//将先序与中序的左子树部分继续递归得到右子树
    	int[] rightpreorder = Arrays.copyOfRange(preorder, pos+1,preorder.length);
    	int[] rightinorder = Arrays.copyOfRange(inorder, pos+1,inorder.length);
    	root.right = BuildTree2(rightpreorder, rightinorder);
    	
    	return root;
	
    }
	//根据中序和后序建立二叉树
    static TreeNode BuildTree1(int[] inorder,int[] postorder) {
    	if(inorder.length==0||postorder.length==0) return null;
    	int x = postorder[postorder.length-1];//根据后序找到根节点
    	TreeNode root = new TreeNode(x);
    	int pos = 0;
    	for (int i = 0; i < inorder.length; i++) {//在中序中找到分割点
			if(inorder[i]==x) {
				pos = i;break;
			}
		}
    	//将后序与中序的左子树部分继续递归得到左子树
    	int[] leftinorder = Arrays.copyOfRange(inorder, 0,pos);
    	int[] leftpostorder = Arrays.copyOfRange(postorder, 0,pos);
    	root.left = BuildTree1(leftinorder, leftpostorder);
    	//将后序与中序的左子树部分继续递归得到右子树
    	int[] rightinorder = Arrays.copyOfRange(inorder, pos+1,inorder.length);
    	int[] rightpostorder = Arrays.copyOfRange(postorder, pos,postorder.length-1);
    	root.right = BuildTree1(rightinorder, rightpostorder);
    	
    	return root;
	
    }
	static void print(TreeNode head) {//先序遍历
		if (head == null)
			return;
		System.out.print(head.val + " ");
		print(head.left);
		print(head.right);
	}
	static void print2(TreeNode head) {//后序遍历
		if (head == null)
			return;
		print2(head.left);
		print2(head.right);
		System.out.print(head.val + " ");
	}
	public static void main(String[] args) {
        int[] preorder = {1,2,4,5,3,6};
        int[] inorder = {4,2,5,1,6,3};
        int[] postorder = {4,5,2,6,3,1};
//       TreeNode root =  BuildTree1(inorder, postorder);
       TreeNode root =  BuildTree2(preorder, inorder);
       print2(root);
	}

}