重建二叉树

重建二叉树

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建出二叉树并输出它的头结点

class Solution{
   private Map<integer,integer> indexMap;
   public TreeNode myBuildTree(int[] preorder, int[] inorder, int preorder_left, int preorder_right, int inorder_left, int inorder_right){
      if(preorder_left > preorder_right) return null;
      int preorder_root = preorder_left;
      int inorder_root = indexMap.get(preorder[preorder_root]);
      TreeNode root = new TreeNode(preorder[preorder_root]);
      int size_left_subtree = inorder_root - inorder_left;
      root.left = myBuildTree(preorder, inorder, preorder_left + 1, preorder_left+size_left_subtree, inorder_left, inorder_root-1);
      root.right = myBuildTree(preorder, inorder, preorder_left+size_left_subtree+1, preorder_right, inorder_root+1, inorder_right);
      return root;
  }
  public TreeNode buildTree(int[] preorder, int[] inorder){
     int n = preorder.lenght;
     indexMap = new HashMap<integer, integer>();
     for( int i=0; i<n;i++){
        indexMap.put(inorder[i],i);
     }
     return myBuildTree(preorder,inorder,0,n-1,0,n-1);
  }
}