LeetCode-construct-binary-tree-from-preorder-and-inorder-traversal

Given preorder and inorder traversal of a tree, construct the binary tree.

Note: 
You may assume that duplicates do not exist in the tree.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        if(preorder==null||inorder==null||preorder.length!=inorder.length)
            return null;
        return build(preorder, inorder, 0, preorder.length - 1, 0, inorder.length - 1);
    }
     
    public TreeNode build(int[] preorder, int[] inorder, int prestart, int preend, int instart, int inend){
        if(preend<prestart||inend<instart)
            return null;
        TreeNode root= new TreeNode(preorder[prestart]);
        int size = 0;
        int i = instart;
        for(; i <= inend; i++){
            if(root.val == inorder[i]){
                size = i - instart;
                break;}
        }
        root.left = build(preorder, inorder, prestart + 1, prestart + size, instart, i - 1 );
        root.right = build(preorder, inorder, prestart + size + 1, preend , i + 1 ,inend );
        return root;
         
    }
     
}