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.

思路：注意current = preorder[pstart],不是preorder[0];

preorder: current, left, right;

inorder: left, current, right;

由preorder来确定current，然后搜索inorder，找到current，左边的即为left，右边的即为right，然后计算两个left，right 区间，然后recursion；

/**
 * 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) {
        if(preorder == null || inorder == null) {
            return null;
        }
        return build(preorder, 0, preorder.length - 1,
                    inorder, 0, inorder.length - 1);
    }
    
    private TreeNode build(int[] preorder, int pstart, int pend,
                          int[] inorder, int istart, int iend) {
        if(pstart > pend || istart > iend) {
            return null;
        }
        TreeNode root = new TreeNode(preorder[pstart]);
        int i = 0;
        for(; i < iend; i++) {
            if(inorder[i] == root.val) {
                break;
            }
        }
        int leftlen = i - istart; //别忘记start point是istart，所以要减去istart；
        root.left = build(preorder, pstart + 1, pstart + leftlen,
                         inorder, istart, i - 1);
        root.right = build(preorder, pstart + leftlen + 1, pend,
                          inorder, i + 1, iend);
        return root;
    }
}