/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
List<Integer> preorderlist = new ArrayList();
List<Integer> inorderlist = new ArrayList();
for (int i = 0; i < preorder.length; i++) {
preorderlist.add(preorder[i]);
inorderlist.add(inorder[i]);
}
return subtree(preorderlist,inorderlist);
}
public TreeNode subtree(List<Integer> preorderlist, List<Integer> inorderlist) {
if (inorderlist.size() == 0) {
return null;
}
TreeNode root = new TreeNode(preorderlist.remove(0));
int mid = inorderlist.indexOf(root.val);
root.left = subtree(preorderlist,inorderlist.subList(0,mid));
root.right = subtree(preorderlist,inorderlist.subList(mid + 1, inorderlist.size()));
return root;
}
}