73.Construct Binary Tree from Preorder and Inorder Traversal-前序遍历和中序遍历树构造二叉树（中等题）

前序遍历和中序遍历树构造二叉树

1. 题目

   根据前序遍历和中序遍历树构造二叉树.

   注意事项
   你可以假设树中不存在相同数值的节点

2. 样例

   给出中序遍历：[1,2,3]和前序遍历：[2,1,3]. 返回如下的树:
   

3. 题解

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */


public class Solution {
    /**
     *@param preorder : A list of integers that preorder traversal of a tree
     *@param inorder : A list of integers that inorder traversal of a tree
     *@return : Root of a tree
     */
    public TreeNode buildTree(int[] preorder, int[] inorder)
    {
        if (inorder.length != preorder.length)
        {
            return null;
        }
        return myBuildTree(inorder, 0, inorder.length - 1, preorder, 0,
                preorder.length - 1);
    }

    private int findPosition(int[] arr, int start, int end, int key)
    {
        for (int i = start; i <= end; i++)
        {
            if (arr[i] == key)
            {
                return i;
            }
        }
        return -1;
    }

    private TreeNode myBuildTree(int[] inorder, int instart, int inend,
            int[] preorder, int prestart, int preend)
    {
        if (instart > inend)
        {
            return null;
        }

        TreeNode root = new TreeNode(preorder[prestart]);
        int position = findPosition(inorder, instart, inend,
                preorder[prestart]);

        root.left = myBuildTree(inorder, instart, position - 1, preorder,
                prestart + 1, prestart + position - instart);
        root.right = myBuildTree(inorder, position + 1, inend, preorder,
                position - inend + preend + 1, preend);
        return root;
    }
}

Last Update 2016.10.2