前序中序和中序后序构建二叉树

先序和中序构建二叉树

  public TreeNode buildTree(int[] preorder, int[] inorder) {
   
            if(preorder.length==0 || preorder == null) return null;

            TreeNode root = new TreeNode(preorder[0]);
            int index = pos(preorder,inorder);
            root.left = buildTree(Arrays.copyOfRange(preorder,1,index+1),Arrays.<