重建二叉树 迭代算法

package leetcode_algorithm;



public class 面试题07重建二叉树 {
    public TreeNode BuildTree(int[] preorder, int[] inorder) {
        //获取第一个root节点
//在第二个数组中判断是否有左子数和右子树，既左右都有子数组
//将默认将左侧数的二维数组 放到left节点，在将右侧子树放到right 递归 buildTree


TreeNode tree = new TreeNode(1);
        tree.val = preorder[0];

        System.out.println(tree.val);
        int[] nextpreorder = new int[preorder.length-1];
        int[] nextinorder = new int[preorder.length-1];
        System.arraycopy(preorder, 0, preorder, 0, 3);
        return tree;
    }
    public class TreeNode {
        public int val;
        public TreeNode left;
        public TreeNode right;

        public TreeNode(int x) {
            val = x;
        }
    }
}