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.

分析：

1. 前序遍历的第一个节点为树的根节点

2. 在中序遍历中找到根节点，左边是根节点的左子树，右边是根节点的右子树

3. 递归的构建左右子树

Java代码实现：

/**
 * Definition for a binary tree node.
 * 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 || preorder.length==0)
            return null;
            
        return helper(preorder, inorder, 0, preorder.length-1, 0, inorder.length-1);
    }
    
    private TreeNode helper(int[] preorder, int[] inorder, int prestart, int preend, int instart, int inend)
    {
        int rootval = preorder[prestart];
        TreeNode root = new TreeNode(rootval);
        int mid = findnode(inorder, rootval, instart, inend);
        int leftnum = mid - instart;
        if(mid > instart)
            root.left = helper(preorder, inorder, prestart+1, prestart+leftnum, instart, mid-1);
        if(mid < inend)
            root.right = helper(preorder, inorder, prestart+1+leftnum, preend, mid+1, inend);
            
        return root;
    }
    private int findnode(int[] arr, int num, int start, int end)
    {
        for(int i=start;i<=end;i++)
        {
            if(arr[i]==num)
                return i;
        }
        return -1;
    }
}